/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_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:12:07,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:12:07,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:12:07,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:12:07,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:12:07,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:12:07,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:12:07,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:12:07,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:12:07,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:12:07,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:12:07,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:12:07,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:12:07,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:12:07,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:12:07,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:12:07,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:12:07,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:12:07,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:12:07,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:12:07,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:12:07,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:12:07,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:12:07,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:12:07,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:12:07,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:12:07,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:12:07,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:12:07,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:12:07,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:12:07,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:12:07,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:12:07,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:12:07,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:12:07,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:12:07,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:12:07,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:12:07,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:12:07,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:12:07,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:12:07,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:12:07,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-02-10 20:12:07,508 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:12:07,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:12:07,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:12:07,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:12:07,511 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:12:07,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:12:07,511 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:12:07,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:12:07,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:12:07,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:12:07,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:12:07,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:12:07,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:12:07,514 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:12:07,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:12:07,514 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:12:07,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:12:07,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:12:07,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:12:07,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:12:07,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:12:07,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:12:07,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:12:07,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:12:07,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:12:07,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:12:07,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:12:07,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:12:07,517 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:12:07,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:12:07,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:12:07,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:12:07,809 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:12:07,809 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:12:07,810 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_9.bpl [2020-02-10 20:12:07,811 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_9.bpl' [2020-02-10 20:12:07,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:12:07,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:12:07,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:12:07,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:12:07,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:12:07,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/1) ... [2020-02-10 20:12:07,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/1) ... [2020-02-10 20:12:07,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:12:07,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:12:07,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:12:07,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:12:07,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/1) ... [2020-02-10 20:12:07,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/1) ... [2020-02-10 20:12:07,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/1) ... [2020-02-10 20:12:07,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/1) ... [2020-02-10 20:12:07,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/1) ... [2020-02-10 20:12:07,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/1) ... [2020-02-10 20:12:07,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/1) ... [2020-02-10 20:12:07,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:12:07,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:12:07,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:12:07,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:12:07,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:12:07,976 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:12:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:12:07,977 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:12:07,977 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:12:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:12:07,978 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:12:07,978 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:12:07,978 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:12:07,978 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:12:07,978 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:12:07,979 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:12:07,979 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:12:07,979 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:12:07,979 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:12:07,980 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:12:07,980 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:12:07,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:12:07,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:12:07,980 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 20:12:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 20:12:07,981 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 20:12:07,981 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 20:12:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 20:12:07,981 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 20:12:07,983 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 20:12:07,983 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 20:12:07,983 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 20:12:07,983 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_8 given in one single declaration [2020-02-10 20:12:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure set_8 [2020-02-10 20:12:07,984 INFO L138 BoogieDeclarations]: Found implementation of procedure set_8 [2020-02-10 20:12:07,985 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:12:08,296 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:12:08,296 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:12:08,300 INFO L202 PluginConnector]: Adding new model example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:12:08 BoogieIcfgContainer [2020-02-10 20:12:08,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:12:08,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:12:08,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:12:08,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:12:08,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:07" (1/2) ... [2020-02-10 20:12:08,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203aa78d and model type example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:12:08, skipping insertion in model container [2020-02-10 20:12:08,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:12:08" (2/2) ... [2020-02-10 20:12:08,309 INFO L109 eAbstractionObserver]: Analyzing ICFG example_9.bpl [2020-02-10 20:12:08,320 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:12:08,320 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:12:08,328 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:12:08,329 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:12:08,548 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-02-10 20:12:08,568 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:12:08,568 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:12:08,568 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:12:08,568 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:12:08,569 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:12:08,569 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:12:08,569 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:12:08,569 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:12:08,584 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 120 transitions [2020-02-10 20:12:08,585 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 120 transitions [2020-02-10 20:12:09,575 INFO L129 PetriNetUnfolder]: 1793/2334 cut-off events. [2020-02-10 20:12:09,575 INFO L130 PetriNetUnfolder]: For 2304/2304 co-relation queries the response was YES. [2020-02-10 20:12:09,621 INFO L76 FinitePrefix]: Finished finitePrefix Result has 4666 conditions, 2334 events. 1793/2334 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8911 event pairs. 0/2333 useless extension candidates. Maximal degree in co-relation 2090. Up to 630 conditions per place. [2020-02-10 20:12:09,696 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 120 transitions [2020-02-10 20:12:10,552 INFO L129 PetriNetUnfolder]: 1793/2334 cut-off events. [2020-02-10 20:12:10,553 INFO L130 PetriNetUnfolder]: For 2304/2304 co-relation queries the response was YES. [2020-02-10 20:12:10,582 INFO L76 FinitePrefix]: Finished finitePrefix Result has 4666 conditions, 2334 events. 1793/2334 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8911 event pairs. 0/2333 useless extension candidates. Maximal degree in co-relation 2090. Up to 630 conditions per place. [2020-02-10 20:12:10,632 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2736 [2020-02-10 20:12:10,634 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 20:12:11,010 INFO L206 etLargeBlockEncoding]: Checked pairs total: 756 [2020-02-10 20:12:11,011 INFO L214 etLargeBlockEncoding]: Total number of compositions: 10 [2020-02-10 20:12:11,016 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 110 transitions [2020-02-10 20:12:13,729 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 20196 states. [2020-02-10 20:12:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20196 states. [2020-02-10 20:12:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:13,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:13,878 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,885 INFO L82 PathProgramCache]: Analyzing trace with hash 114387570, now seen corresponding path program 1 times [2020-02-10 20:12:13,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974429974] [2020-02-10 20:12:13,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974429974] [2020-02-10 20:12:14,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:14,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638401935] [2020-02-10 20:12:14,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:14,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:14,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:14,111 INFO L87 Difference]: Start difference. First operand 20196 states. Second operand 3 states. [2020-02-10 20:12:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,459 INFO L93 Difference]: Finished difference Result 18916 states and 109908 transitions. [2020-02-10 20:12:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:14,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:12:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,704 INFO L225 Difference]: With dead ends: 18916 [2020-02-10 20:12:14,705 INFO L226 Difference]: Without dead ends: 18915 [2020-02-10 20:12:14,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18915 states. [2020-02-10 20:12:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18915 to 18915. [2020-02-10 20:12:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18915 states. [2020-02-10 20:12:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18915 states to 18915 states and 109907 transitions. [2020-02-10 20:12:16,868 INFO L78 Accepts]: Start accepts. Automaton has 18915 states and 109907 transitions. Word has length 28 [2020-02-10 20:12:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,869 INFO L479 AbstractCegarLoop]: Abstraction has 18915 states and 109907 transitions. [2020-02-10 20:12:16,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 18915 states and 109907 transitions. [2020-02-10 20:12:16,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:16,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:16,959 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,959 INFO L82 PathProgramCache]: Analyzing trace with hash -520253774, now seen corresponding path program 1 times [2020-02-10 20:12:16,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437062648] [2020-02-10 20:12:16,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437062648] [2020-02-10 20:12:16,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:16,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091854600] [2020-02-10 20:12:16,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:16,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:16,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:16,998 INFO L87 Difference]: Start difference. First operand 18915 states and 109907 transitions. Second operand 3 states. [2020-02-10 20:12:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,111 INFO L93 Difference]: Finished difference Result 15971 states and 88467 transitions. [2020-02-10 20:12:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:18,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:12:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,245 INFO L225 Difference]: With dead ends: 15971 [2020-02-10 20:12:18,246 INFO L226 Difference]: Without dead ends: 15971 [2020-02-10 20:12:18,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15971 states. [2020-02-10 20:12:18,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15971 to 15971. [2020-02-10 20:12:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15971 states. [2020-02-10 20:12:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15971 states to 15971 states and 88467 transitions. [2020-02-10 20:12:19,037 INFO L78 Accepts]: Start accepts. Automaton has 15971 states and 88467 transitions. Word has length 28 [2020-02-10 20:12:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,037 INFO L479 AbstractCegarLoop]: Abstraction has 15971 states and 88467 transitions. [2020-02-10 20:12:19,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 15971 states and 88467 transitions. [2020-02-10 20:12:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:19,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:19,091 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1967135382, now seen corresponding path program 1 times [2020-02-10 20:12:19,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889652046] [2020-02-10 20:12:19,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889652046] [2020-02-10 20:12:19,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:19,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218796176] [2020-02-10 20:12:19,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:19,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:19,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:19,163 INFO L87 Difference]: Start difference. First operand 15971 states and 88467 transitions. Second operand 3 states. [2020-02-10 20:12:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,516 INFO L93 Difference]: Finished difference Result 10243 states and 54163 transitions. [2020-02-10 20:12:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:19,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:12:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,559 INFO L225 Difference]: With dead ends: 10243 [2020-02-10 20:12:19,559 INFO L226 Difference]: Without dead ends: 10243 [2020-02-10 20:12:19,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10243 states. [2020-02-10 20:12:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10243 to 10243. [2020-02-10 20:12:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10243 states. [2020-02-10 20:12:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10243 states to 10243 states and 54163 transitions. [2020-02-10 20:12:20,030 INFO L78 Accepts]: Start accepts. Automaton has 10243 states and 54163 transitions. Word has length 28 [2020-02-10 20:12:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,030 INFO L479 AbstractCegarLoop]: Abstraction has 10243 states and 54163 transitions. [2020-02-10 20:12:20,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 10243 states and 54163 transitions. [2020-02-10 20:12:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:20,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:20,077 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2067096892, now seen corresponding path program 1 times [2020-02-10 20:12:20,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682403691] [2020-02-10 20:12:20,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682403691] [2020-02-10 20:12:20,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:20,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812081718] [2020-02-10 20:12:20,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:20,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:20,149 INFO L87 Difference]: Start difference. First operand 10243 states and 54163 transitions. Second operand 3 states. [2020-02-10 20:12:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,244 INFO L93 Difference]: Finished difference Result 9987 states and 52243 transitions. [2020-02-10 20:12:20,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:20,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:12:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,280 INFO L225 Difference]: With dead ends: 9987 [2020-02-10 20:12:20,280 INFO L226 Difference]: Without dead ends: 9987 [2020-02-10 20:12:20,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9987 states. [2020-02-10 20:12:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9987 to 9987. [2020-02-10 20:12:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9987 states. [2020-02-10 20:12:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9987 states to 9987 states and 52243 transitions. [2020-02-10 20:12:21,848 INFO L78 Accepts]: Start accepts. Automaton has 9987 states and 52243 transitions. Word has length 28 [2020-02-10 20:12:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,849 INFO L479 AbstractCegarLoop]: Abstraction has 9987 states and 52243 transitions. [2020-02-10 20:12:21,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 9987 states and 52243 transitions. [2020-02-10 20:12:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:21,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,889 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:21,890 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,890 INFO L82 PathProgramCache]: Analyzing trace with hash -77951046, now seen corresponding path program 1 times [2020-02-10 20:12:21,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269620111] [2020-02-10 20:12:21,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:21,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269620111] [2020-02-10 20:12:21,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:21,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276802965] [2020-02-10 20:12:21,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:21,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:21,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:21,958 INFO L87 Difference]: Start difference. First operand 9987 states and 52243 transitions. Second operand 3 states. [2020-02-10 20:12:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,038 INFO L93 Difference]: Finished difference Result 6171 states and 30927 transitions. [2020-02-10 20:12:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:22,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:12:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,060 INFO L225 Difference]: With dead ends: 6171 [2020-02-10 20:12:22,060 INFO L226 Difference]: Without dead ends: 6171 [2020-02-10 20:12:22,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2020-02-10 20:12:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 6171. [2020-02-10 20:12:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6171 states. [2020-02-10 20:12:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6171 states to 6171 states and 30927 transitions. [2020-02-10 20:12:22,333 INFO L78 Accepts]: Start accepts. Automaton has 6171 states and 30927 transitions. Word has length 28 [2020-02-10 20:12:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,334 INFO L479 AbstractCegarLoop]: Abstraction has 6171 states and 30927 transitions. [2020-02-10 20:12:22,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6171 states and 30927 transitions. [2020-02-10 20:12:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:22,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,354 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1337464426, now seen corresponding path program 1 times [2020-02-10 20:12:22,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017618447] [2020-02-10 20:12:22,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017618447] [2020-02-10 20:12:22,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:22,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791992015] [2020-02-10 20:12:22,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:22,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:22,400 INFO L87 Difference]: Start difference. First operand 6171 states and 30927 transitions. Second operand 3 states. [2020-02-10 20:12:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,444 INFO L93 Difference]: Finished difference Result 3883 states and 18511 transitions. [2020-02-10 20:12:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:22,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:12:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,457 INFO L225 Difference]: With dead ends: 3883 [2020-02-10 20:12:22,458 INFO L226 Difference]: Without dead ends: 3883 [2020-02-10 20:12:22,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2020-02-10 20:12:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3883. [2020-02-10 20:12:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3883 states. [2020-02-10 20:12:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 18511 transitions. [2020-02-10 20:12:22,599 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 18511 transitions. Word has length 28 [2020-02-10 20:12:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,600 INFO L479 AbstractCegarLoop]: Abstraction has 3883 states and 18511 transitions. [2020-02-10 20:12:22,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 18511 transitions. [2020-02-10 20:12:22,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:22,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,609 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1461842622, now seen corresponding path program 1 times [2020-02-10 20:12:22,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006701396] [2020-02-10 20:12:22,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006701396] [2020-02-10 20:12:22,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:22,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551091462] [2020-02-10 20:12:22,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:22,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:22,632 INFO L87 Difference]: Start difference. First operand 3883 states and 18511 transitions. Second operand 3 states. [2020-02-10 20:12:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,659 INFO L93 Difference]: Finished difference Result 2539 states and 11503 transitions. [2020-02-10 20:12:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:22,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:12:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,667 INFO L225 Difference]: With dead ends: 2539 [2020-02-10 20:12:22,668 INFO L226 Difference]: Without dead ends: 2539 [2020-02-10 20:12:22,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2020-02-10 20:12:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2539. [2020-02-10 20:12:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2539 states. [2020-02-10 20:12:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 11503 transitions. [2020-02-10 20:12:22,763 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 11503 transitions. Word has length 28 [2020-02-10 20:12:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,764 INFO L479 AbstractCegarLoop]: Abstraction has 2539 states and 11503 transitions. [2020-02-10 20:12:22,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 11503 transitions. [2020-02-10 20:12:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:22,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,770 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1283995022, now seen corresponding path program 1 times [2020-02-10 20:12:22,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865444366] [2020-02-10 20:12:22,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865444366] [2020-02-10 20:12:22,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:22,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050433629] [2020-02-10 20:12:22,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:22,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:22,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:22,795 INFO L87 Difference]: Start difference. First operand 2539 states and 11503 transitions. Second operand 3 states. [2020-02-10 20:12:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,815 INFO L93 Difference]: Finished difference Result 1535 states and 6913 transitions. [2020-02-10 20:12:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:22,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:12:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,821 INFO L225 Difference]: With dead ends: 1535 [2020-02-10 20:12:22,821 INFO L226 Difference]: Without dead ends: 1535 [2020-02-10 20:12:22,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:22,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2020-02-10 20:12:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535. [2020-02-10 20:12:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2020-02-10 20:12:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 6913 transitions. [2020-02-10 20:12:22,882 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 6913 transitions. Word has length 28 [2020-02-10 20:12:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,882 INFO L479 AbstractCegarLoop]: Abstraction has 1535 states and 6913 transitions. [2020-02-10 20:12:22,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 6913 transitions. [2020-02-10 20:12:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:22,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12: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, 1, 1, 1] [2020-02-10 20:12:22,886 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash 662697718, now seen corresponding path program 1 times [2020-02-10 20:12:22,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197934875] [2020-02-10 20:12:22,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,607 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:12:23,744 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-02-10 20:12:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197934875] [2020-02-10 20:12:23,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:23,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122980138] [2020-02-10 20:12:23,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:23,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:23,761 INFO L87 Difference]: Start difference. First operand 1535 states and 6913 transitions. Second operand 11 states. [2020-02-10 20:12:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,013 INFO L93 Difference]: Finished difference Result 3001 states and 11928 transitions. [2020-02-10 20:12:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:24,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,023 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:12:24,023 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 20:12:24,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 20:12:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1583. [2020-02-10 20:12:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:12:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7118 transitions. [2020-02-10 20:12:24,206 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7118 transitions. Word has length 28 [2020-02-10 20:12:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,208 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7118 transitions. [2020-02-10 20:12:24,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7118 transitions. [2020-02-10 20:12:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:24,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:24,215 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1407400216, now seen corresponding path program 2 times [2020-02-10 20:12:24,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596171742] [2020-02-10 20:12:24,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:24,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596171742] [2020-02-10 20:12:24,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:24,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786305429] [2020-02-10 20:12:24,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:24,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:24,885 INFO L87 Difference]: Start difference. First operand 1583 states and 7118 transitions. Second operand 11 states. [2020-02-10 20:12:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,178 INFO L93 Difference]: Finished difference Result 3002 states and 11925 transitions. [2020-02-10 20:12:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:25,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,185 INFO L225 Difference]: With dead ends: 3002 [2020-02-10 20:12:25,185 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:12:25,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:12:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1578. [2020-02-10 20:12:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:12:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7104 transitions. [2020-02-10 20:12:25,273 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7104 transitions. Word has length 28 [2020-02-10 20:12:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,273 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7104 transitions. [2020-02-10 20:12:25,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7104 transitions. [2020-02-10 20:12:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:25,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:25,278 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2021328620, now seen corresponding path program 3 times [2020-02-10 20:12:25,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87839678] [2020-02-10 20:12:25,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87839678] [2020-02-10 20:12:25,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:25,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366109048] [2020-02-10 20:12:25,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:25,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:25,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:25,908 INFO L87 Difference]: Start difference. First operand 1578 states and 7104 transitions. Second operand 11 states. [2020-02-10 20:12:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,120 INFO L93 Difference]: Finished difference Result 3006 states and 11932 transitions. [2020-02-10 20:12:26,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:26,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,128 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:12:26,128 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:12:26,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:12:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1584. [2020-02-10 20:12:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:12:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7115 transitions. [2020-02-10 20:12:26,227 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7115 transitions. Word has length 28 [2020-02-10 20:12:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,228 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7115 transitions. [2020-02-10 20:12:26,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7115 transitions. [2020-02-10 20:12:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:26,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:26,233 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,233 INFO L82 PathProgramCache]: Analyzing trace with hash -531923624, now seen corresponding path program 4 times [2020-02-10 20:12:26,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124425128] [2020-02-10 20:12:26,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,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-02-10 20:12:26,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124425128] [2020-02-10 20:12:26,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:26,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365804607] [2020-02-10 20:12:26,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:26,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:26,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:26,854 INFO L87 Difference]: Start difference. First operand 1584 states and 7115 transitions. Second operand 11 states. [2020-02-10 20:12:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,048 INFO L93 Difference]: Finished difference Result 3011 states and 11936 transitions. [2020-02-10 20:12:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:27,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,056 INFO L225 Difference]: With dead ends: 3011 [2020-02-10 20:12:27,056 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:12:27,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:12:27,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1578. [2020-02-10 20:12:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:12:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7098 transitions. [2020-02-10 20:12:27,184 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7098 transitions. Word has length 28 [2020-02-10 20:12:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,185 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7098 transitions. [2020-02-10 20:12:27,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7098 transitions. [2020-02-10 20:12:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:27,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:27,189 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,189 INFO L82 PathProgramCache]: Analyzing trace with hash 334314836, now seen corresponding path program 5 times [2020-02-10 20:12:27,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478167724] [2020-02-10 20:12:27,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,759 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:12:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478167724] [2020-02-10 20:12:27,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:27,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921415101] [2020-02-10 20:12:27,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:27,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:27,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:27,771 INFO L87 Difference]: Start difference. First operand 1578 states and 7098 transitions. Second operand 11 states. [2020-02-10 20:12:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,977 INFO L93 Difference]: Finished difference Result 3009 states and 11933 transitions. [2020-02-10 20:12:27,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:27,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,986 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:12:27,986 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 20:12:27,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 20:12:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1585. [2020-02-10 20:12:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:12:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7111 transitions. [2020-02-10 20:12:28,076 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7111 transitions. Word has length 28 [2020-02-10 20:12:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,077 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7111 transitions. [2020-02-10 20:12:28,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7111 transitions. [2020-02-10 20:12:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:28,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:28,081 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1079017334, now seen corresponding path program 6 times [2020-02-10 20:12:28,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320667914] [2020-02-10 20:12:28,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:28,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320667914] [2020-02-10 20:12:28,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:28,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415668551] [2020-02-10 20:12:28,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:28,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:28,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:28,679 INFO L87 Difference]: Start difference. First operand 1585 states and 7111 transitions. Second operand 11 states. [2020-02-10 20:12:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,834 INFO L93 Difference]: Finished difference Result 3013 states and 11934 transitions. [2020-02-10 20:12:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:28,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,842 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 20:12:28,842 INFO L226 Difference]: Without dead ends: 2980 [2020-02-10 20:12:28,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:28,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2020-02-10 20:12:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1572. [2020-02-10 20:12:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:12:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7081 transitions. [2020-02-10 20:12:28,913 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7081 transitions. Word has length 28 [2020-02-10 20:12:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,914 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7081 transitions. [2020-02-10 20:12:28,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7081 transitions. [2020-02-10 20:12:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:28,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:28,917 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1382710192, now seen corresponding path program 7 times [2020-02-10 20:12:28,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933929040] [2020-02-10 20:12:28,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:29,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933929040] [2020-02-10 20:12:29,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:29,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579060267] [2020-02-10 20:12:29,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:29,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:29,512 INFO L87 Difference]: Start difference. First operand 1572 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:12:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,725 INFO L93 Difference]: Finished difference Result 2996 states and 11912 transitions. [2020-02-10 20:12:29,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:29,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:29,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,733 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:12:29,733 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:12:29,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:12:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1582. [2020-02-10 20:12:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:12:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7109 transitions. [2020-02-10 20:12:29,802 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7109 transitions. Word has length 28 [2020-02-10 20:12:29,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,802 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7109 transitions. [2020-02-10 20:12:29,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7109 transitions. [2020-02-10 20:12:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:29,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:29,805 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:29,805 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:29,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2127412690, now seen corresponding path program 8 times [2020-02-10 20:12:29,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:29,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854020421] [2020-02-10 20:12:29,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:30,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854020421] [2020-02-10 20:12:30,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:30,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:30,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507139590] [2020-02-10 20:12:30,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:30,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:30,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:30,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:30,391 INFO L87 Difference]: Start difference. First operand 1582 states and 7109 transitions. Second operand 11 states. [2020-02-10 20:12:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:30,641 INFO L93 Difference]: Finished difference Result 2997 states and 11909 transitions. [2020-02-10 20:12:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:30,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:30,649 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 20:12:30,649 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:12:30,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:12:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1577. [2020-02-10 20:12:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:12:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7095 transitions. [2020-02-10 20:12:30,727 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7095 transitions. Word has length 28 [2020-02-10 20:12:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:30,727 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7095 transitions. [2020-02-10 20:12:30,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7095 transitions. [2020-02-10 20:12:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:30,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:30,731 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:30,731 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:30,732 INFO L82 PathProgramCache]: Analyzing trace with hash 309624812, now seen corresponding path program 9 times [2020-02-10 20:12:30,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:30,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156275380] [2020-02-10 20:12:30,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:31,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156275380] [2020-02-10 20:12:31,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:31,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:31,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868136021] [2020-02-10 20:12:31,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:31,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:31,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:31,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:31,302 INFO L87 Difference]: Start difference. First operand 1577 states and 7095 transitions. Second operand 11 states. [2020-02-10 20:12:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:31,511 INFO L93 Difference]: Finished difference Result 2998 states and 11911 transitions. [2020-02-10 20:12:31,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:31,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:31,520 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:12:31,520 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:12:31,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:12:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1582. [2020-02-10 20:12:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:12:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7104 transitions. [2020-02-10 20:12:31,587 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7104 transitions. Word has length 28 [2020-02-10 20:12:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:31,588 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7104 transitions. [2020-02-10 20:12:31,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7104 transitions. [2020-02-10 20:12:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:31,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:31,591 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:31,591 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:31,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:31,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1751234990, now seen corresponding path program 10 times [2020-02-10 20:12:31,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:31,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644835514] [2020-02-10 20:12:31,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:32,142 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:12:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:32,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644835514] [2020-02-10 20:12:32,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:32,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:32,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469894535] [2020-02-10 20:12:32,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:32,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:32,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:32,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:32,151 INFO L87 Difference]: Start difference. First operand 1582 states and 7104 transitions. Second operand 11 states. [2020-02-10 20:12:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:32,366 INFO L93 Difference]: Finished difference Result 3001 states and 11912 transitions. [2020-02-10 20:12:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:32,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:32,376 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:12:32,376 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:12:32,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:12:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1577. [2020-02-10 20:12:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:12:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7090 transitions. [2020-02-10 20:12:32,468 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7090 transitions. Word has length 28 [2020-02-10 20:12:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:32,468 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7090 transitions. [2020-02-10 20:12:32,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7090 transitions. [2020-02-10 20:12:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:32,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:32,472 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:32,472 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1629699028, now seen corresponding path program 11 times [2020-02-10 20:12:32,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:32,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576827881] [2020-02-10 20:12:32,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:33,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576827881] [2020-02-10 20:12:33,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:33,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:33,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877932180] [2020-02-10 20:12:33,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:33,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:33,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:33,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:33,119 INFO L87 Difference]: Start difference. First operand 1577 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:12:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:33,306 INFO L93 Difference]: Finished difference Result 3001 states and 11913 transitions. [2020-02-10 20:12:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:33,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:33,315 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:12:33,315 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:12:33,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:12:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1583. [2020-02-10 20:12:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:12:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7101 transitions. [2020-02-10 20:12:33,392 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7101 transitions. Word has length 28 [2020-02-10 20:12:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:33,393 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7101 transitions. [2020-02-10 20:12:33,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7101 transitions. [2020-02-10 20:12:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:33,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:33,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:33,397 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash -140294032, now seen corresponding path program 12 times [2020-02-10 20:12:33,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:33,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061746481] [2020-02-10 20:12:33,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:33,877 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 20:12:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:34,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061746481] [2020-02-10 20:12:34,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:34,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:34,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637478963] [2020-02-10 20:12:34,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:34,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:34,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:34,015 INFO L87 Difference]: Start difference. First operand 1583 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:12:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:34,208 INFO L93 Difference]: Finished difference Result 3003 states and 11911 transitions. [2020-02-10 20:12:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:34,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:34,216 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:12:34,216 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:12:34,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:12:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1572. [2020-02-10 20:12:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:12:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7076 transitions. [2020-02-10 20:12:34,301 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7076 transitions. Word has length 28 [2020-02-10 20:12:34,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:34,302 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7076 transitions. [2020-02-10 20:12:34,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7076 transitions. [2020-02-10 20:12:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:34,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:34,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:34,304 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:34,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1393213296, now seen corresponding path program 13 times [2020-02-10 20:12:34,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:34,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567197965] [2020-02-10 20:12:34,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:34,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567197965] [2020-02-10 20:12:34,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:34,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:34,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348780598] [2020-02-10 20:12:34,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:34,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:34,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:34,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:34,880 INFO L87 Difference]: Start difference. First operand 1572 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:12:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:35,074 INFO L93 Difference]: Finished difference Result 3012 states and 11939 transitions. [2020-02-10 20:12:35,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:35,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:35,082 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:12:35,082 INFO L226 Difference]: Without dead ends: 2997 [2020-02-10 20:12:35,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2020-02-10 20:12:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1585. [2020-02-10 20:12:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:12:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7111 transitions. [2020-02-10 20:12:35,148 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7111 transitions. Word has length 28 [2020-02-10 20:12:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:35,148 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7111 transitions. [2020-02-10 20:12:35,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7111 transitions. [2020-02-10 20:12:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:35,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:35,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, 1, 1, 1] [2020-02-10 20:12:35,152 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:35,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1412349004, now seen corresponding path program 14 times [2020-02-10 20:12:35,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:35,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356189460] [2020-02-10 20:12:35,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:35,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356189460] [2020-02-10 20:12:35,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:35,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:35,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38436743] [2020-02-10 20:12:35,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:35,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:35,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:35,767 INFO L87 Difference]: Start difference. First operand 1585 states and 7111 transitions. Second operand 11 states. [2020-02-10 20:12:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:35,976 INFO L93 Difference]: Finished difference Result 3017 states and 11943 transitions. [2020-02-10 20:12:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:35,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:35,984 INFO L225 Difference]: With dead ends: 3017 [2020-02-10 20:12:35,984 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:12:35,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:12:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1579. [2020-02-10 20:12:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:12:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7094 transitions. [2020-02-10 20:12:36,051 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7094 transitions. Word has length 28 [2020-02-10 20:12:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:36,051 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7094 transitions. [2020-02-10 20:12:36,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7094 transitions. [2020-02-10 20:12:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:36,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:36,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:36,054 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1290813042, now seen corresponding path program 15 times [2020-02-10 20:12:36,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:36,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647654452] [2020-02-10 20:12:36,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:36,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647654452] [2020-02-10 20:12:36,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:36,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:36,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527244241] [2020-02-10 20:12:36,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:36,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:36,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:36,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:36,635 INFO L87 Difference]: Start difference. First operand 1579 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:12:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:36,862 INFO L93 Difference]: Finished difference Result 3009 states and 11928 transitions. [2020-02-10 20:12:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:36,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:36,870 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:12:36,870 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 20:12:36,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 20:12:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1584. [2020-02-10 20:12:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:12:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7103 transitions. [2020-02-10 20:12:36,938 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7103 transitions. Word has length 28 [2020-02-10 20:12:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:36,938 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7103 transitions. [2020-02-10 20:12:36,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7103 transitions. [2020-02-10 20:12:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:36,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:36,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:36,941 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash 943294452, now seen corresponding path program 16 times [2020-02-10 20:12:36,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:36,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331943038] [2020-02-10 20:12:36,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:37,556 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:12:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:37,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331943038] [2020-02-10 20:12:37,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:37,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:37,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274107353] [2020-02-10 20:12:37,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:37,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:37,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:37,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:37,566 INFO L87 Difference]: Start difference. First operand 1584 states and 7103 transitions. Second operand 11 states. [2020-02-10 20:12:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:37,784 INFO L93 Difference]: Finished difference Result 3012 states and 11929 transitions. [2020-02-10 20:12:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:37,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:37,792 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:12:37,792 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:12:37,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:12:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1579. [2020-02-10 20:12:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:12:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7089 transitions. [2020-02-10 20:12:37,857 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7089 transitions. Word has length 28 [2020-02-10 20:12:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:37,857 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7089 transitions. [2020-02-10 20:12:37,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7089 transitions. [2020-02-10 20:12:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:37,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:37,860 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:37,860 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash -874493426, now seen corresponding path program 17 times [2020-02-10 20:12:37,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:37,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621488297] [2020-02-10 20:12:37,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:38,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621488297] [2020-02-10 20:12:38,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:38,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:38,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656657480] [2020-02-10 20:12:38,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:38,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:38,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:38,441 INFO L87 Difference]: Start difference. First operand 1579 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:12:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:38,656 INFO L93 Difference]: Finished difference Result 3024 states and 11953 transitions. [2020-02-10 20:12:38,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:38,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:38,664 INFO L225 Difference]: With dead ends: 3024 [2020-02-10 20:12:38,664 INFO L226 Difference]: Without dead ends: 3004 [2020-02-10 20:12:38,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2020-02-10 20:12:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 1589. [2020-02-10 20:12:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 20:12:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7106 transitions. [2020-02-10 20:12:38,731 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7106 transitions. Word has length 28 [2020-02-10 20:12:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:38,731 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7106 transitions. [2020-02-10 20:12:38,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7106 transitions. [2020-02-10 20:12:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:38,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:38,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:38,734 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:38,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:38,735 INFO L82 PathProgramCache]: Analyzing trace with hash -129790928, now seen corresponding path program 18 times [2020-02-10 20:12:38,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:38,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484369349] [2020-02-10 20:12:38,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:39,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484369349] [2020-02-10 20:12:39,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:39,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:39,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276971022] [2020-02-10 20:12:39,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:39,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:39,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:39,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:39,295 INFO L87 Difference]: Start difference. First operand 1589 states and 7106 transitions. Second operand 11 states. [2020-02-10 20:12:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:39,508 INFO L93 Difference]: Finished difference Result 3022 states and 11941 transitions. [2020-02-10 20:12:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:39,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:39,516 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 20:12:39,516 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 20:12:39,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 20:12:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1572. [2020-02-10 20:12:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:12:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7069 transitions. [2020-02-10 20:12:39,581 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7069 transitions. Word has length 28 [2020-02-10 20:12:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:39,582 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7069 transitions. [2020-02-10 20:12:39,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7069 transitions. [2020-02-10 20:12:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:39,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:39,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:39,584 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:39,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:39,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2146548398, now seen corresponding path program 19 times [2020-02-10 20:12:39,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:39,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907672699] [2020-02-10 20:12:39,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:40,032 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2020-02-10 20:12:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:40,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907672699] [2020-02-10 20:12:40,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:40,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:40,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932498757] [2020-02-10 20:12:40,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:40,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:40,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:40,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:40,153 INFO L87 Difference]: Start difference. First operand 1572 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:12:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:40,351 INFO L93 Difference]: Finished difference Result 3019 states and 11951 transitions. [2020-02-10 20:12:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:40,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:40,359 INFO L225 Difference]: With dead ends: 3019 [2020-02-10 20:12:40,359 INFO L226 Difference]: Without dead ends: 3003 [2020-02-10 20:12:40,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2020-02-10 20:12:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1587. [2020-02-10 20:12:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:12:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7110 transitions. [2020-02-10 20:12:40,429 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7110 transitions. Word has length 28 [2020-02-10 20:12:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:40,430 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7110 transitions. [2020-02-10 20:12:40,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7110 transitions. [2020-02-10 20:12:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:40,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:40,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:40,433 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1401845900, now seen corresponding path program 20 times [2020-02-10 20:12:40,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:40,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421047768] [2020-02-10 20:12:40,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:41,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421047768] [2020-02-10 20:12:41,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:41,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:41,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521776906] [2020-02-10 20:12:41,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:41,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:41,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:41,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:41,041 INFO L87 Difference]: Start difference. First operand 1587 states and 7110 transitions. Second operand 11 states. [2020-02-10 20:12:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:41,252 INFO L93 Difference]: Finished difference Result 3023 states and 11952 transitions. [2020-02-10 20:12:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:41,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:41,259 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 20:12:41,259 INFO L226 Difference]: Without dead ends: 2996 [2020-02-10 20:12:41,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2020-02-10 20:12:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 1580. [2020-02-10 20:12:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:12:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7090 transitions. [2020-02-10 20:12:41,324 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7090 transitions. Word has length 28 [2020-02-10 20:12:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:41,325 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7090 transitions. [2020-02-10 20:12:41,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7090 transitions. [2020-02-10 20:12:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:41,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:41,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:41,327 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:41,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:41,328 INFO L82 PathProgramCache]: Analyzing trace with hash -535607440, now seen corresponding path program 21 times [2020-02-10 20:12:41,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:41,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988646924] [2020-02-10 20:12:41,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:41,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988646924] [2020-02-10 20:12:41,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:41,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:41,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933100883] [2020-02-10 20:12:41,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:41,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:41,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:41,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:41,984 INFO L87 Difference]: Start difference. First operand 1580 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:12:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:42,231 INFO L93 Difference]: Finished difference Result 3016 states and 11939 transitions. [2020-02-10 20:12:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:42,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:42,239 INFO L225 Difference]: With dead ends: 3016 [2020-02-10 20:12:42,239 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 20:12:42,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 20:12:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1586. [2020-02-10 20:12:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:12:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7101 transitions. [2020-02-10 20:12:42,312 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7101 transitions. Word has length 28 [2020-02-10 20:12:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:42,312 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7101 transitions. [2020-02-10 20:12:42,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7101 transitions. [2020-02-10 20:12:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:42,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:42,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:42,316 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash 953797556, now seen corresponding path program 22 times [2020-02-10 20:12:42,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:42,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219292748] [2020-02-10 20:12:42,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:42,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219292748] [2020-02-10 20:12:42,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:42,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:42,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265425300] [2020-02-10 20:12:42,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:42,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:42,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:42,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:42,882 INFO L87 Difference]: Start difference. First operand 1586 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:12:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,059 INFO L93 Difference]: Finished difference Result 3018 states and 11937 transitions. [2020-02-10 20:12:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:43,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,067 INFO L225 Difference]: With dead ends: 3018 [2020-02-10 20:12:43,067 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 20:12:43,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 20:12:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1580. [2020-02-10 20:12:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:12:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7084 transitions. [2020-02-10 20:12:43,143 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7084 transitions. Word has length 28 [2020-02-10 20:12:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,143 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7084 transitions. [2020-02-10 20:12:43,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7084 transitions. [2020-02-10 20:12:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:43,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:43,147 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1820036016, now seen corresponding path program 23 times [2020-02-10 20:12:43,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757146728] [2020-02-10 20:12:43,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:43,715 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:12:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:43,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757146728] [2020-02-10 20:12:43,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:43,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:43,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347210602] [2020-02-10 20:12:43,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:43,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:43,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:43,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:43,724 INFO L87 Difference]: Start difference. First operand 1580 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:12:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,885 INFO L93 Difference]: Finished difference Result 3028 states and 11956 transitions. [2020-02-10 20:12:43,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:43,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,894 INFO L225 Difference]: With dead ends: 3028 [2020-02-10 20:12:43,894 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 20:12:43,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 20:12:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1590. [2020-02-10 20:12:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:12:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7101 transitions. [2020-02-10 20:12:43,959 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7101 transitions. Word has length 28 [2020-02-10 20:12:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,959 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7101 transitions. [2020-02-10 20:12:43,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7101 transitions. [2020-02-10 20:12:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:43,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:43,963 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1730228782, now seen corresponding path program 24 times [2020-02-10 20:12:43,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238355625] [2020-02-10 20:12:43,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:44,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238355625] [2020-02-10 20:12:44,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:44,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:44,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190777674] [2020-02-10 20:12:44,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:44,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:44,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:44,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:44,566 INFO L87 Difference]: Start difference. First operand 1590 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:12:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:44,783 INFO L93 Difference]: Finished difference Result 3026 states and 11944 transitions. [2020-02-10 20:12:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:44,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:44,791 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 20:12:44,791 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:12:44,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:12:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1565. [2020-02-10 20:12:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:12:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7049 transitions. [2020-02-10 20:12:44,858 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7049 transitions. Word has length 28 [2020-02-10 20:12:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:44,859 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7049 transitions. [2020-02-10 20:12:44,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7049 transitions. [2020-02-10 20:12:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:44,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12: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, 1, 1, 1] [2020-02-10 20:12:44,862 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:44,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:44,862 INFO L82 PathProgramCache]: Analyzing trace with hash 582955646, now seen corresponding path program 25 times [2020-02-10 20:12:44,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:44,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757353478] [2020-02-10 20:12:44,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:45,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757353478] [2020-02-10 20:12:45,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:45,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:45,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142175494] [2020-02-10 20:12:45,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:45,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:45,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:45,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:45,493 INFO L87 Difference]: Start difference. First operand 1565 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:12:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:45,728 INFO L93 Difference]: Finished difference Result 2995 states and 11908 transitions. [2020-02-10 20:12:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:45,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:45,736 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:12:45,736 INFO L226 Difference]: Without dead ends: 2980 [2020-02-10 20:12:45,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2020-02-10 20:12:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1582. [2020-02-10 20:12:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:12:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7108 transitions. [2020-02-10 20:12:45,801 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7108 transitions. Word has length 28 [2020-02-10 20:12:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:45,802 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7108 transitions. [2020-02-10 20:12:45,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7108 transitions. [2020-02-10 20:12:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:45,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:45,805 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:45,805 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:45,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:45,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1327658144, now seen corresponding path program 26 times [2020-02-10 20:12:45,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:45,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988046745] [2020-02-10 20:12:45,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:46,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988046745] [2020-02-10 20:12:46,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:46,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:46,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779351353] [2020-02-10 20:12:46,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:46,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:46,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:46,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:46,413 INFO L87 Difference]: Start difference. First operand 1582 states and 7108 transitions. Second operand 11 states. [2020-02-10 20:12:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:46,598 INFO L93 Difference]: Finished difference Result 2996 states and 11905 transitions. [2020-02-10 20:12:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:46,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:46,605 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:12:46,605 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:12:46,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:12:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1577. [2020-02-10 20:12:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:12:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7094 transitions. [2020-02-10 20:12:46,677 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7094 transitions. Word has length 28 [2020-02-10 20:12:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:46,677 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7094 transitions. [2020-02-10 20:12:46,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7094 transitions. [2020-02-10 20:12:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:46,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:46,681 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:46,681 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2101070692, now seen corresponding path program 27 times [2020-02-10 20:12:46,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:46,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37117834] [2020-02-10 20:12:46,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:47,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37117834] [2020-02-10 20:12:47,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:47,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:47,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642548342] [2020-02-10 20:12:47,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:47,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:47,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:47,229 INFO L87 Difference]: Start difference. First operand 1577 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:12:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:47,482 INFO L93 Difference]: Finished difference Result 3000 states and 11912 transitions. [2020-02-10 20:12:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:47,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:47,492 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 20:12:47,493 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:12:47,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:12:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1583. [2020-02-10 20:12:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:12:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7105 transitions. [2020-02-10 20:12:47,599 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7105 transitions. Word has length 28 [2020-02-10 20:12:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:47,599 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7105 transitions. [2020-02-10 20:12:47,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7105 transitions. [2020-02-10 20:12:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:47,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:47,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:47,603 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:47,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:47,603 INFO L82 PathProgramCache]: Analyzing trace with hash -611665696, now seen corresponding path program 28 times [2020-02-10 20:12:47,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:47,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442375099] [2020-02-10 20:12:47,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:48,170 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2020-02-10 20:12:48,298 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-02-10 20:12:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:48,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442375099] [2020-02-10 20:12:48,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:48,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:48,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847384461] [2020-02-10 20:12:48,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:48,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:48,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:48,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:48,308 INFO L87 Difference]: Start difference. First operand 1583 states and 7105 transitions. Second operand 11 states. [2020-02-10 20:12:48,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:48,481 INFO L93 Difference]: Finished difference Result 3005 states and 11916 transitions. [2020-02-10 20:12:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:48,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:48,489 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:12:48,489 INFO L226 Difference]: Without dead ends: 2979 [2020-02-10 20:12:48,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2020-02-10 20:12:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 1577. [2020-02-10 20:12:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:12:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7088 transitions. [2020-02-10 20:12:48,558 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7088 transitions. Word has length 28 [2020-02-10 20:12:48,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:48,558 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7088 transitions. [2020-02-10 20:12:48,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7088 transitions. [2020-02-10 20:12:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:48,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:48,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, 1, 1, 1] [2020-02-10 20:12:48,560 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash 254572764, now seen corresponding path program 29 times [2020-02-10 20:12:48,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:48,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298928226] [2020-02-10 20:12:48,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:49,138 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:12:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:49,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298928226] [2020-02-10 20:12:49,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:49,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:49,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894814243] [2020-02-10 20:12:49,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:49,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:49,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:49,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:49,147 INFO L87 Difference]: Start difference. First operand 1577 states and 7088 transitions. Second operand 11 states. [2020-02-10 20:12:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:49,339 INFO L93 Difference]: Finished difference Result 3003 states and 11913 transitions. [2020-02-10 20:12:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:49,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:49,351 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:12:49,351 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 20:12:49,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 20:12:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1584. [2020-02-10 20:12:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:12:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7101 transitions. [2020-02-10 20:12:49,416 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7101 transitions. Word has length 28 [2020-02-10 20:12:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:49,416 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7101 transitions. [2020-02-10 20:12:49,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7101 transitions. [2020-02-10 20:12:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:49,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:49,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:49,419 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:49,419 INFO L82 PathProgramCache]: Analyzing trace with hash 999275262, now seen corresponding path program 30 times [2020-02-10 20:12:49,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:49,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535270988] [2020-02-10 20:12:49,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:49,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535270988] [2020-02-10 20:12:49,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:49,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:49,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850068453] [2020-02-10 20:12:49,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:49,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:49,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:49,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:49,984 INFO L87 Difference]: Start difference. First operand 1584 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:12:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:50,169 INFO L93 Difference]: Finished difference Result 3007 states and 11914 transitions. [2020-02-10 20:12:50,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:50,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:50,177 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 20:12:50,178 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:12:50,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:12:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1571. [2020-02-10 20:12:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:12:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7071 transitions. [2020-02-10 20:12:50,243 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7071 transitions. Word has length 28 [2020-02-10 20:12:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:50,243 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7071 transitions. [2020-02-10 20:12:50,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7071 transitions. [2020-02-10 20:12:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:50,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:50,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:50,246 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:50,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:50,246 INFO L82 PathProgramCache]: Analyzing trace with hash -242257480, now seen corresponding path program 31 times [2020-02-10 20:12:50,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:50,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757271087] [2020-02-10 20:12:50,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:50,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757271087] [2020-02-10 20:12:50,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:50,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:50,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561995766] [2020-02-10 20:12:50,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:50,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:50,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:50,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:50,926 INFO L87 Difference]: Start difference. First operand 1571 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:12:51,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:51,146 INFO L93 Difference]: Finished difference Result 2989 states and 11890 transitions. [2020-02-10 20:12:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:51,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:51,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:51,153 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:12:51,154 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:12:51,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:12:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1581. [2020-02-10 20:12:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:12:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7099 transitions. [2020-02-10 20:12:51,219 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7099 transitions. Word has length 28 [2020-02-10 20:12:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:51,219 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7099 transitions. [2020-02-10 20:12:51,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7099 transitions. [2020-02-10 20:12:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:51,221 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:51,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, 1, 1, 1] [2020-02-10 20:12:51,222 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash 502445018, now seen corresponding path program 32 times [2020-02-10 20:12:51,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:51,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125227581] [2020-02-10 20:12:51,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:51,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125227581] [2020-02-10 20:12:51,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:51,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:51,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354111019] [2020-02-10 20:12:51,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:51,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:51,788 INFO L87 Difference]: Start difference. First operand 1581 states and 7099 transitions. Second operand 11 states. [2020-02-10 20:12:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:51,974 INFO L93 Difference]: Finished difference Result 2990 states and 11887 transitions. [2020-02-10 20:12:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:51,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:51,983 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:12:51,983 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:12:51,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:12:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1576. [2020-02-10 20:12:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:12:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7085 transitions. [2020-02-10 20:12:52,062 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7085 transitions. Word has length 28 [2020-02-10 20:12:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:52,062 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7085 transitions. [2020-02-10 20:12:52,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7085 transitions. [2020-02-10 20:12:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:52,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:52,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, 1, 1, 1] [2020-02-10 20:12:52,065 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:52,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1850572662, now seen corresponding path program 33 times [2020-02-10 20:12:52,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:52,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967991213] [2020-02-10 20:12:52,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:52,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967991213] [2020-02-10 20:12:52,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:52,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:52,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517456127] [2020-02-10 20:12:52,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:52,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:52,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:52,623 INFO L87 Difference]: Start difference. First operand 1576 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:12:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:52,860 INFO L93 Difference]: Finished difference Result 2990 states and 11887 transitions. [2020-02-10 20:12:52,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:52,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:52,868 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:12:52,868 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:12:52,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:12:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1581. [2020-02-10 20:12:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:12:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7094 transitions. [2020-02-10 20:12:52,933 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7094 transitions. Word has length 28 [2020-02-10 20:12:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:52,933 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7094 transitions. [2020-02-10 20:12:52,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7094 transitions. [2020-02-10 20:12:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:52,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:52,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:52,935 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:52,936 INFO L82 PathProgramCache]: Analyzing trace with hash -187919974, now seen corresponding path program 34 times [2020-02-10 20:12:52,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:52,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764689483] [2020-02-10 20:12:52,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:53,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764689483] [2020-02-10 20:12:53,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:53,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:53,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363576617] [2020-02-10 20:12:53,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:53,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:53,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:53,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:53,563 INFO L87 Difference]: Start difference. First operand 1581 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:12:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,757 INFO L93 Difference]: Finished difference Result 2992 states and 11886 transitions. [2020-02-10 20:12:53,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:53,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,765 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:12:53,765 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:12:53,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:12:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1576. [2020-02-10 20:12:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:12:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7080 transitions. [2020-02-10 20:12:53,830 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7080 transitions. Word has length 28 [2020-02-10 20:12:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,830 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7080 transitions. [2020-02-10 20:12:53,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7080 transitions. [2020-02-10 20:12:53,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:53,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:53,833 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash 505070794, now seen corresponding path program 35 times [2020-02-10 20:12:53,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157032299] [2020-02-10 20:12:53,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:54,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157032299] [2020-02-10 20:12:54,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:54,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:54,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206524265] [2020-02-10 20:12:54,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:54,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:54,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:54,431 INFO L87 Difference]: Start difference. First operand 1576 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:12:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:54,645 INFO L93 Difference]: Finished difference Result 2993 states and 11889 transitions. [2020-02-10 20:12:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:54,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:54,652 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:12:54,652 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 20:12:54,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 20:12:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1582. [2020-02-10 20:12:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:12:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7091 transitions. [2020-02-10 20:12:54,716 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7091 transitions. Word has length 28 [2020-02-10 20:12:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:54,717 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7091 transitions. [2020-02-10 20:12:54,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7091 transitions. [2020-02-10 20:12:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:54,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:54,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:54,720 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:54,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:54,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1423020984, now seen corresponding path program 36 times [2020-02-10 20:12:54,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:54,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080049349] [2020-02-10 20:12:54,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:55,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080049349] [2020-02-10 20:12:55,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:55,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:55,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48784403] [2020-02-10 20:12:55,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:55,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:55,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:55,284 INFO L87 Difference]: Start difference. First operand 1582 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:12:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:55,554 INFO L93 Difference]: Finished difference Result 2994 states and 11885 transitions. [2020-02-10 20:12:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:55,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:55,562 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 20:12:55,562 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:12:55,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:12:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1571. [2020-02-10 20:12:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:12:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7066 transitions. [2020-02-10 20:12:55,626 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7066 transitions. Word has length 28 [2020-02-10 20:12:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:55,626 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7066 transitions. [2020-02-10 20:12:55,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7066 transitions. [2020-02-10 20:12:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:55,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:55,629 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:55,629 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:55,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:55,629 INFO L82 PathProgramCache]: Analyzing trace with hash -231754376, now seen corresponding path program 37 times [2020-02-10 20:12:55,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:55,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229863022] [2020-02-10 20:12:55,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:56,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229863022] [2020-02-10 20:12:56,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:56,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:56,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588404143] [2020-02-10 20:12:56,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:56,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:56,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:56,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:56,178 INFO L87 Difference]: Start difference. First operand 1571 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:12:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:56,438 INFO L93 Difference]: Finished difference Result 3002 states and 11911 transitions. [2020-02-10 20:12:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:56,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:56,446 INFO L225 Difference]: With dead ends: 3002 [2020-02-10 20:12:56,446 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 20:12:56,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 20:12:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1583. [2020-02-10 20:12:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:12:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7099 transitions. [2020-02-10 20:12:56,510 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7099 transitions. Word has length 28 [2020-02-10 20:12:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:56,510 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7099 transitions. [2020-02-10 20:12:56,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7099 transitions. [2020-02-10 20:12:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:56,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:56,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:56,514 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:56,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1257650620, now seen corresponding path program 38 times [2020-02-10 20:12:56,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:56,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810529495] [2020-02-10 20:12:56,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:57,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810529495] [2020-02-10 20:12:57,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:57,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:57,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261061422] [2020-02-10 20:12:57,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:57,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:57,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:57,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:57,064 INFO L87 Difference]: Start difference. First operand 1583 states and 7099 transitions. Second operand 11 states. [2020-02-10 20:12:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:57,273 INFO L93 Difference]: Finished difference Result 3007 states and 11915 transitions. [2020-02-10 20:12:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:57,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:57,281 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 20:12:57,281 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:12:57,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:12:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1577. [2020-02-10 20:12:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:12:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7082 transitions. [2020-02-10 20:12:57,349 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7082 transitions. Word has length 28 [2020-02-10 20:12:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:57,349 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7082 transitions. [2020-02-10 20:12:57,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7082 transitions. [2020-02-10 20:12:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:57,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12: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, 1, 1, 1] [2020-02-10 20:12:57,352 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash 843956780, now seen corresponding path program 39 times [2020-02-10 20:12:57,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:57,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731860935] [2020-02-10 20:12:57,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:57,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731860935] [2020-02-10 20:12:57,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:57,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:57,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798592186] [2020-02-10 20:12:57,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:57,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:57,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:57,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:57,905 INFO L87 Difference]: Start difference. First operand 1577 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:12:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:58,088 INFO L93 Difference]: Finished difference Result 2998 states and 11898 transitions. [2020-02-10 20:12:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:58,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:58,096 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:12:58,097 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:12:58,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:12:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1582. [2020-02-10 20:12:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:12:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7091 transitions. [2020-02-10 20:12:58,165 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7091 transitions. Word has length 28 [2020-02-10 20:12:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:58,165 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7091 transitions. [2020-02-10 20:12:58,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7091 transitions. [2020-02-10 20:12:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:58,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:58,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, 1, 1, 1] [2020-02-10 20:12:58,168 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1788357828, now seen corresponding path program 40 times [2020-02-10 20:12:58,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:58,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707480478] [2020-02-10 20:12:58,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:58,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707480478] [2020-02-10 20:12:58,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:58,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:58,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372388266] [2020-02-10 20:12:58,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:58,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:58,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:58,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:58,715 INFO L87 Difference]: Start difference. First operand 1582 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:12:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:58,929 INFO L93 Difference]: Finished difference Result 3000 states and 11897 transitions. [2020-02-10 20:12:58,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:58,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:58,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:58,937 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 20:12:58,937 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:12:58,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:12:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1577. [2020-02-10 20:12:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:12:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7077 transitions. [2020-02-10 20:12:59,005 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7077 transitions. Word has length 28 [2020-02-10 20:12:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,005 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7077 transitions. [2020-02-10 20:12:59,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7077 transitions. [2020-02-10 20:12:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:59,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:59,008 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1260276396, now seen corresponding path program 41 times [2020-02-10 20:12:59,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274109664] [2020-02-10 20:12:59,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:59,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274109664] [2020-02-10 20:12:59,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:59,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:12:59,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021530795] [2020-02-10 20:12:59,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:12:59,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:59,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:12:59,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:59,603 INFO L87 Difference]: Start difference. First operand 1577 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:12:59,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:59,845 INFO L93 Difference]: Finished difference Result 3011 states and 11919 transitions. [2020-02-10 20:12:59,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:12:59,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:12:59,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:59,852 INFO L225 Difference]: With dead ends: 3011 [2020-02-10 20:12:59,852 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:12:59,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:12:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:12:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1585. [2020-02-10 20:12:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:12:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7091 transitions. [2020-02-10 20:12:59,919 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7091 transitions. Word has length 28 [2020-02-10 20:12:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,919 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7091 transitions. [2020-02-10 20:12:59,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:12:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7091 transitions. [2020-02-10 20:12:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:12:59,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:59,923 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1433524088, now seen corresponding path program 42 times [2020-02-10 20:12:59,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703164257] [2020-02-10 20:12:59,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:00,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703164257] [2020-02-10 20:13:00,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:00,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:00,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013468387] [2020-02-10 20:13:00,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:00,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:00,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:00,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:00,460 INFO L87 Difference]: Start difference. First operand 1585 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:13:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:00,739 INFO L93 Difference]: Finished difference Result 3008 states and 11906 transitions. [2020-02-10 20:13:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:00,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:00,746 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 20:13:00,746 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 20:13:00,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 20:13:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1571. [2020-02-10 20:13:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:13:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7060 transitions. [2020-02-10 20:13:00,810 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7060 transitions. Word has length 28 [2020-02-10 20:13:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:00,810 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7060 transitions. [2020-02-10 20:13:00,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7060 transitions. [2020-02-10 20:13:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:00,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:00,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:00,813 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash 523451226, now seen corresponding path program 43 times [2020-02-10 20:13:00,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:00,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136284260] [2020-02-10 20:13:00,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:01,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136284260] [2020-02-10 20:13:01,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:01,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:01,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453320437] [2020-02-10 20:13:01,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:01,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:01,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:01,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:01,375 INFO L87 Difference]: Start difference. First operand 1571 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:13:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:01,670 INFO L93 Difference]: Finished difference Result 3009 states and 11924 transitions. [2020-02-10 20:13:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:01,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:01,678 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:13:01,678 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 20:13:01,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 20:13:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1585. [2020-02-10 20:13:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:13:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7099 transitions. [2020-02-10 20:13:01,744 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7099 transitions. Word has length 28 [2020-02-10 20:13:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:01,744 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7099 transitions. [2020-02-10 20:13:01,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7099 transitions. [2020-02-10 20:13:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:01,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:01,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:01,747 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1268153724, now seen corresponding path program 44 times [2020-02-10 20:13:01,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:01,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715196886] [2020-02-10 20:13:01,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:02,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715196886] [2020-02-10 20:13:02,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:02,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:02,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730787981] [2020-02-10 20:13:02,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:02,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:02,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:02,289 INFO L87 Difference]: Start difference. First operand 1585 states and 7099 transitions. Second operand 11 states. [2020-02-10 20:13:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:02,517 INFO L93 Difference]: Finished difference Result 3013 states and 11925 transitions. [2020-02-10 20:13:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:02,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:02,524 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 20:13:02,525 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 20:13:02,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 20:13:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1578. [2020-02-10 20:13:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:13:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7079 transitions. [2020-02-10 20:13:02,589 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7079 transitions. Word has length 28 [2020-02-10 20:13:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:02,590 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7079 transitions. [2020-02-10 20:13:02,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7079 transitions. [2020-02-10 20:13:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:02,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:02,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:02,592 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:02,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1599162382, now seen corresponding path program 45 times [2020-02-10 20:13:02,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:02,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713443557] [2020-02-10 20:13:02,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:03,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713443557] [2020-02-10 20:13:03,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:03,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:03,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911913405] [2020-02-10 20:13:03,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:03,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:03,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:03,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:03,137 INFO L87 Difference]: Start difference. First operand 1578 states and 7079 transitions. Second operand 11 states. [2020-02-10 20:13:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:03,325 INFO L93 Difference]: Finished difference Result 3005 states and 11910 transitions. [2020-02-10 20:13:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:03,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:03,333 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:13:03,333 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:13:03,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:13:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1584. [2020-02-10 20:13:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:13:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7090 transitions. [2020-02-10 20:13:03,397 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7090 transitions. Word has length 28 [2020-02-10 20:13:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:03,397 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7090 transitions. [2020-02-10 20:13:03,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7090 transitions. [2020-02-10 20:13:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:03,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:03,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:03,400 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:03,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:03,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1777854724, now seen corresponding path program 46 times [2020-02-10 20:13:03,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:03,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088667529] [2020-02-10 20:13:03,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:03,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088667529] [2020-02-10 20:13:03,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:03,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:03,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735006119] [2020-02-10 20:13:03,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:03,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:03,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:03,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:03,932 INFO L87 Difference]: Start difference. First operand 1584 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:13:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:04,103 INFO L93 Difference]: Finished difference Result 3006 states and 11906 transitions. [2020-02-10 20:13:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:04,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:04,111 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:13:04,111 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:13:04,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:13:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1578. [2020-02-10 20:13:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:13:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 20:13:04,183 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 20:13:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:04,183 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 20:13:04,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 20:13:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:04,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:04,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:04,187 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:04,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:04,187 INFO L82 PathProgramCache]: Analyzing trace with hash -340161458, now seen corresponding path program 47 times [2020-02-10 20:13:04,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:04,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385084722] [2020-02-10 20:13:04,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:04,727 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:13:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:04,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385084722] [2020-02-10 20:13:04,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:04,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:04,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590220160] [2020-02-10 20:13:04,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:04,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:04,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:04,736 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:13:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:04,891 INFO L93 Difference]: Finished difference Result 3015 states and 11923 transitions. [2020-02-10 20:13:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:04,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:04,899 INFO L225 Difference]: With dead ends: 3015 [2020-02-10 20:13:04,900 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:13:04,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:13:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1586. [2020-02-10 20:13:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:13:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7087 transitions. [2020-02-10 20:13:04,964 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7087 transitions. Word has length 28 [2020-02-10 20:13:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:04,964 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7087 transitions. [2020-02-10 20:13:04,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7087 transitions. [2020-02-10 20:13:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:04,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:04,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:04,967 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash -166913766, now seen corresponding path program 48 times [2020-02-10 20:13:04,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:04,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888760134] [2020-02-10 20:13:04,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:05,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888760134] [2020-02-10 20:13:05,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:05,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:05,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441453079] [2020-02-10 20:13:05,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:05,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:05,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:05,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:05,545 INFO L87 Difference]: Start difference. First operand 1586 states and 7087 transitions. Second operand 11 states. [2020-02-10 20:13:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:05,735 INFO L93 Difference]: Finished difference Result 3012 states and 11910 transitions. [2020-02-10 20:13:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:05,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:05,743 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:13:05,743 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:13:05,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:13:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1565. [2020-02-10 20:13:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:13:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7043 transitions. [2020-02-10 20:13:05,807 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7043 transitions. Word has length 28 [2020-02-10 20:13:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:05,807 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7043 transitions. [2020-02-10 20:13:05,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7043 transitions. [2020-02-10 20:13:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:05,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:05,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:05,810 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:05,810 INFO L82 PathProgramCache]: Analyzing trace with hash 15547412, now seen corresponding path program 49 times [2020-02-10 20:13:05,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:05,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283907342] [2020-02-10 20:13:05,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:06,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283907342] [2020-02-10 20:13:06,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:06,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:06,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571831297] [2020-02-10 20:13:06,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:06,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:06,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:06,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:06,352 INFO L87 Difference]: Start difference. First operand 1565 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:13:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:06,543 INFO L93 Difference]: Finished difference Result 2981 states and 11870 transitions. [2020-02-10 20:13:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:06,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:06,551 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:13:06,551 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:13:06,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:13:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1580. [2020-02-10 20:13:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:13:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7095 transitions. [2020-02-10 20:13:06,615 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7095 transitions. Word has length 28 [2020-02-10 20:13:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:06,615 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7095 transitions. [2020-02-10 20:13:06,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7095 transitions. [2020-02-10 20:13:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:06,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:06,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:06,618 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:06,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:06,618 INFO L82 PathProgramCache]: Analyzing trace with hash 760249910, now seen corresponding path program 50 times [2020-02-10 20:13:06,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:06,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357450206] [2020-02-10 20:13:06,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:07,145 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:13:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:07,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357450206] [2020-02-10 20:13:07,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:07,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:07,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434525197] [2020-02-10 20:13:07,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:07,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:07,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:07,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:07,154 INFO L87 Difference]: Start difference. First operand 1580 states and 7095 transitions. Second operand 11 states. [2020-02-10 20:13:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:07,333 INFO L93 Difference]: Finished difference Result 2982 states and 11867 transitions. [2020-02-10 20:13:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:07,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:07,341 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:13:07,341 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:13:07,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:13:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 20:13:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:13:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7081 transitions. [2020-02-10 20:13:07,407 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7081 transitions. Word has length 28 [2020-02-10 20:13:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:07,407 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7081 transitions. [2020-02-10 20:13:07,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7081 transitions. [2020-02-10 20:13:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:07,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:07,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:07,409 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1057537968, now seen corresponding path program 51 times [2020-02-10 20:13:07,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:07,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164791203] [2020-02-10 20:13:07,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:07,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164791203] [2020-02-10 20:13:07,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:07,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:07,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87221495] [2020-02-10 20:13:07,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:07,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:07,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:07,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:07,965 INFO L87 Difference]: Start difference. First operand 1575 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:13:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:08,140 INFO L93 Difference]: Finished difference Result 2983 states and 11869 transitions. [2020-02-10 20:13:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:08,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:08,148 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:13:08,148 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:13:08,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:13:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1580. [2020-02-10 20:13:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:13:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7090 transitions. [2020-02-10 20:13:08,214 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7090 transitions. Word has length 28 [2020-02-10 20:13:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:08,214 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7090 transitions. [2020-02-10 20:13:08,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7090 transitions. [2020-02-10 20:13:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:08,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:08,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:08,217 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:08,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1176569526, now seen corresponding path program 52 times [2020-02-10 20:13:08,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:08,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427191660] [2020-02-10 20:13:08,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:08,760 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:13:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:08,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427191660] [2020-02-10 20:13:08,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:08,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:08,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875955616] [2020-02-10 20:13:08,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:08,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:08,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:08,769 INFO L87 Difference]: Start difference. First operand 1580 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:13:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:08,952 INFO L93 Difference]: Finished difference Result 2986 states and 11870 transitions. [2020-02-10 20:13:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:08,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:08,959 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:13:08,959 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:13:08,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:13:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1575. [2020-02-10 20:13:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:13:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7076 transitions. [2020-02-10 20:13:09,023 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7076 transitions. Word has length 28 [2020-02-10 20:13:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:09,023 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7076 transitions. [2020-02-10 20:13:09,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7076 transitions. [2020-02-10 20:13:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:09,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:09,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:09,026 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:09,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:09,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1298105488, now seen corresponding path program 53 times [2020-02-10 20:13:09,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:09,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549638061] [2020-02-10 20:13:09,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:09,595 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:13:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:09,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549638061] [2020-02-10 20:13:09,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:09,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:09,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801250062] [2020-02-10 20:13:09,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:09,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:09,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:09,604 INFO L87 Difference]: Start difference. First operand 1575 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:13:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:09,777 INFO L93 Difference]: Finished difference Result 2986 states and 11871 transitions. [2020-02-10 20:13:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:09,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:09,784 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:13:09,785 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:13:09,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:13:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1581. [2020-02-10 20:13:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:13:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7087 transitions. [2020-02-10 20:13:09,851 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7087 transitions. Word has length 28 [2020-02-10 20:13:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:09,851 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7087 transitions. [2020-02-10 20:13:09,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7087 transitions. [2020-02-10 20:13:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:09,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:09,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:09,854 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:09,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1507456812, now seen corresponding path program 54 times [2020-02-10 20:13:09,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:09,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373536974] [2020-02-10 20:13:09,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:10,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373536974] [2020-02-10 20:13:10,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:10,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:10,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475090714] [2020-02-10 20:13:10,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:10,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:10,378 INFO L87 Difference]: Start difference. First operand 1581 states and 7087 transitions. Second operand 11 states. [2020-02-10 20:13:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:10,557 INFO L93 Difference]: Finished difference Result 2988 states and 11869 transitions. [2020-02-10 20:13:10,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:10,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:10,565 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:13:10,565 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:13:10,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:13:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1570. [2020-02-10 20:13:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:13:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7062 transitions. [2020-02-10 20:13:10,631 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7062 transitions. Word has length 28 [2020-02-10 20:13:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:10,631 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7062 transitions. [2020-02-10 20:13:10,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7062 transitions. [2020-02-10 20:13:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:10,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:10,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:10,634 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:10,634 INFO L82 PathProgramCache]: Analyzing trace with hash 603292734, now seen corresponding path program 55 times [2020-02-10 20:13:10,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:10,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519478509] [2020-02-10 20:13:10,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:11,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:11,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519478509] [2020-02-10 20:13:11,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:11,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:11,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098914832] [2020-02-10 20:13:11,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:11,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:11,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:11,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:11,184 INFO L87 Difference]: Start difference. First operand 1570 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:13:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:11,361 INFO L93 Difference]: Finished difference Result 2980 states and 11863 transitions. [2020-02-10 20:13:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:11,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:11,369 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:13:11,369 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:13:11,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:13:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1580. [2020-02-10 20:13:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:13:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7090 transitions. [2020-02-10 20:13:11,435 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7090 transitions. Word has length 28 [2020-02-10 20:13:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:11,435 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7090 transitions. [2020-02-10 20:13:11,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7090 transitions. [2020-02-10 20:13:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:11,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:11,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:11,438 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:11,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:11,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1347995232, now seen corresponding path program 56 times [2020-02-10 20:13:11,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:11,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254744664] [2020-02-10 20:13:11,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:11,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254744664] [2020-02-10 20:13:11,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:11,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:11,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536277366] [2020-02-10 20:13:11,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:11,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:11,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:11,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:11,984 INFO L87 Difference]: Start difference. First operand 1580 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:13:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:12,175 INFO L93 Difference]: Finished difference Result 2981 states and 11860 transitions. [2020-02-10 20:13:12,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:12,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:12,183 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:13:12,183 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:13:12,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:13:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1575. [2020-02-10 20:13:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:13:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7076 transitions. [2020-02-10 20:13:12,248 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7076 transitions. Word has length 28 [2020-02-10 20:13:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:12,249 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7076 transitions. [2020-02-10 20:13:12,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7076 transitions. [2020-02-10 20:13:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:12,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:12,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, 1, 1, 1] [2020-02-10 20:13:12,252 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:12,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1005022448, now seen corresponding path program 57 times [2020-02-10 20:13:12,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:12,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85660812] [2020-02-10 20:13:12,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:12,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85660812] [2020-02-10 20:13:12,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:12,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:12,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478886118] [2020-02-10 20:13:12,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:12,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:12,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:12,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:12,802 INFO L87 Difference]: Start difference. First operand 1575 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:13:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:13,049 INFO L93 Difference]: Finished difference Result 2981 states and 11860 transitions. [2020-02-10 20:13:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:13,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:13,060 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:13:13,060 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:13:13,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:13:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1580. [2020-02-10 20:13:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:13:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7085 transitions. [2020-02-10 20:13:13,184 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7085 transitions. Word has length 28 [2020-02-10 20:13:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:13,185 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7085 transitions. [2020-02-10 20:13:13,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7085 transitions. [2020-02-10 20:13:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:13,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:13,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:13,189 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:13,189 INFO L82 PathProgramCache]: Analyzing trace with hash 657630240, now seen corresponding path program 58 times [2020-02-10 20:13:13,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:13,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406564824] [2020-02-10 20:13:13,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:13,746 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:13:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:13,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406564824] [2020-02-10 20:13:13,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:13,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:13,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591842612] [2020-02-10 20:13:13,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:13,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:13,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:13,754 INFO L87 Difference]: Start difference. First operand 1580 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:13:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:13,932 INFO L93 Difference]: Finished difference Result 2983 states and 11859 transitions. [2020-02-10 20:13:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:13,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:13,940 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:13:13,940 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:13:13,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:13:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 20:13:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:13:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 20:13:14,005 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 20:13:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:14,006 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 20:13:14,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 20:13:14,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:14,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13: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, 1, 1, 1] [2020-02-10 20:13:14,008 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:14,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:14,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1350621008, now seen corresponding path program 59 times [2020-02-10 20:13:14,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:14,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547207558] [2020-02-10 20:13:14,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:14,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547207558] [2020-02-10 20:13:14,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:14,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:14,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543922254] [2020-02-10 20:13:14,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:14,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:14,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:14,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:14,547 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:13:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:14,726 INFO L93 Difference]: Finished difference Result 2984 states and 11862 transitions. [2020-02-10 20:13:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:14,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:14,734 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:13:14,734 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:13:14,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:13:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1581. [2020-02-10 20:13:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:13:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7082 transitions. [2020-02-10 20:13:14,798 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7082 transitions. Word has length 28 [2020-02-10 20:13:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:14,799 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7082 transitions. [2020-02-10 20:13:14,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7082 transitions. [2020-02-10 20:13:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:14,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:14,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:14,802 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:14,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:14,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2026396098, now seen corresponding path program 60 times [2020-02-10 20:13:14,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:14,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910236082] [2020-02-10 20:13:14,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:15,361 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:13:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:15,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910236082] [2020-02-10 20:13:15,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:15,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:15,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630013581] [2020-02-10 20:13:15,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:15,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:15,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:15,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:15,370 INFO L87 Difference]: Start difference. First operand 1581 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:13:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:15,551 INFO L93 Difference]: Finished difference Result 2985 states and 11858 transitions. [2020-02-10 20:13:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:15,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:15,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:15,559 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:13:15,559 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:13:15,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:15,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:13:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1570. [2020-02-10 20:13:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:13:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7057 transitions. [2020-02-10 20:13:15,623 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7057 transitions. Word has length 28 [2020-02-10 20:13:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:15,624 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7057 transitions. [2020-02-10 20:13:15,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7057 transitions. [2020-02-10 20:13:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:15,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:15,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:15,626 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash 624298942, now seen corresponding path program 61 times [2020-02-10 20:13:15,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:15,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402674772] [2020-02-10 20:13:15,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:16,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402674772] [2020-02-10 20:13:16,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:16,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204418570] [2020-02-10 20:13:16,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:16,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:16,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:16,158 INFO L87 Difference]: Start difference. First operand 1570 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:13:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:16,335 INFO L93 Difference]: Finished difference Result 2985 states and 11869 transitions. [2020-02-10 20:13:16,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:16,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:16,343 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:13:16,343 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:13:16,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:13:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1580. [2020-02-10 20:13:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:13:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7085 transitions. [2020-02-10 20:13:16,407 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7085 transitions. Word has length 28 [2020-02-10 20:13:16,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:16,408 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7085 transitions. [2020-02-10 20:13:16,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7085 transitions. [2020-02-10 20:13:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:16,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:16,410 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:16,410 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:16,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:16,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1436560860, now seen corresponding path program 62 times [2020-02-10 20:13:16,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:16,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412057306] [2020-02-10 20:13:16,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:16,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412057306] [2020-02-10 20:13:16,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:16,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451260700] [2020-02-10 20:13:16,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:16,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:16,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:16,938 INFO L87 Difference]: Start difference. First operand 1580 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:13:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:17,122 INFO L93 Difference]: Finished difference Result 2988 states and 11870 transitions. [2020-02-10 20:13:17,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:17,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:17,130 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:13:17,131 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:13:17,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:13:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1575. [2020-02-10 20:13:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:13:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 20:13:17,195 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 20:13:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:17,195 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 20:13:17,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 20:13:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:17,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:17,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:17,197 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:17,198 INFO L82 PathProgramCache]: Analyzing trace with hash 89069140, now seen corresponding path program 63 times [2020-02-10 20:13:17,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:17,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004220241] [2020-02-10 20:13:17,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:17,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004220241] [2020-02-10 20:13:17,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:17,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:17,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334479405] [2020-02-10 20:13:17,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:17,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:17,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:17,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:17,750 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:13:17,952 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-02-10 20:13:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:17,967 INFO L93 Difference]: Finished difference Result 2984 states and 11862 transitions. [2020-02-10 20:13:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:17,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:17,975 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:13:17,975 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:13:17,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:13:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1580. [2020-02-10 20:13:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:13:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7080 transitions. [2020-02-10 20:13:18,039 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7080 transitions. Word has length 28 [2020-02-10 20:13:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:18,040 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7080 transitions. [2020-02-10 20:13:18,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7080 transitions. [2020-02-10 20:13:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:18,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:18,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:18,042 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:18,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1751721828, now seen corresponding path program 64 times [2020-02-10 20:13:18,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:18,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972167532] [2020-02-10 20:13:18,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:18,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972167532] [2020-02-10 20:13:18,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:18,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:18,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740445604] [2020-02-10 20:13:18,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:18,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:18,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:18,584 INFO L87 Difference]: Start difference. First operand 1580 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:13:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:18,761 INFO L93 Difference]: Finished difference Result 2986 states and 11861 transitions. [2020-02-10 20:13:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:18,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:18,770 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:13:18,770 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:13:18,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:13:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1575. [2020-02-10 20:13:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:13:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7066 transitions. [2020-02-10 20:13:18,835 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7066 transitions. Word has length 28 [2020-02-10 20:13:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:18,835 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7066 transitions. [2020-02-10 20:13:18,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7066 transitions. [2020-02-10 20:13:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:18,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:18,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:18,838 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1433935084, now seen corresponding path program 65 times [2020-02-10 20:13:18,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:18,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340927461] [2020-02-10 20:13:18,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:19,405 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:13:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:19,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340927461] [2020-02-10 20:13:19,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:19,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:19,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653274009] [2020-02-10 20:13:19,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:19,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:19,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:19,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:19,414 INFO L87 Difference]: Start difference. First operand 1575 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:13:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:19,596 INFO L93 Difference]: Finished difference Result 2992 states and 11875 transitions. [2020-02-10 20:13:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:19,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:19,607 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:13:19,607 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:13:19,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:13:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1582. [2020-02-10 20:13:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:13:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7079 transitions. [2020-02-10 20:13:19,677 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7079 transitions. Word has length 28 [2020-02-10 20:13:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:19,677 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7079 transitions. [2020-02-10 20:13:19,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7079 transitions. [2020-02-10 20:13:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:19,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:19,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:19,680 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:19,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2005389890, now seen corresponding path program 66 times [2020-02-10 20:13:19,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:19,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338487110] [2020-02-10 20:13:19,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:20,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338487110] [2020-02-10 20:13:20,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:20,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:20,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914138267] [2020-02-10 20:13:20,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:20,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:20,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:20,192 INFO L87 Difference]: Start difference. First operand 1582 states and 7079 transitions. Second operand 11 states. [2020-02-10 20:13:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:20,377 INFO L93 Difference]: Finished difference Result 2991 states and 11866 transitions. [2020-02-10 20:13:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:20,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:20,385 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:13:20,385 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:13:20,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:20,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:13:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1570. [2020-02-10 20:13:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:13:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 20:13:20,449 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 20:13:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:20,450 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 20:13:20,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 20:13:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:20,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:20,452 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:20,452 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1379504544, now seen corresponding path program 67 times [2020-02-10 20:13:20,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:20,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484232850] [2020-02-10 20:13:20,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:21,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484232850] [2020-02-10 20:13:21,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:21,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:21,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50382777] [2020-02-10 20:13:21,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:21,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:21,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:21,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:21,002 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:13:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:21,187 INFO L93 Difference]: Finished difference Result 2992 states and 11883 transitions. [2020-02-10 20:13:21,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:21,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:21,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:21,195 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:13:21,196 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:13:21,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:13:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1582. [2020-02-10 20:13:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:13:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7086 transitions. [2020-02-10 20:13:21,260 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7086 transitions. Word has length 28 [2020-02-10 20:13:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:21,260 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7086 transitions. [2020-02-10 20:13:21,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7086 transitions. [2020-02-10 20:13:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:21,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:21,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:21,263 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:21,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:21,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1426057756, now seen corresponding path program 68 times [2020-02-10 20:13:21,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:21,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48722641] [2020-02-10 20:13:21,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:21,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48722641] [2020-02-10 20:13:21,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:21,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:21,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676354078] [2020-02-10 20:13:21,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:21,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:21,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:21,809 INFO L87 Difference]: Start difference. First operand 1582 states and 7086 transitions. Second operand 11 states. [2020-02-10 20:13:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:22,030 INFO L93 Difference]: Finished difference Result 2994 states and 11881 transitions. [2020-02-10 20:13:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:22,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:22,038 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 20:13:22,038 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:13:22,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:13:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1576. [2020-02-10 20:13:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:13:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7069 transitions. [2020-02-10 20:13:22,139 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7069 transitions. Word has length 28 [2020-02-10 20:13:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:22,140 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7069 transitions. [2020-02-10 20:13:22,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7069 transitions. [2020-02-10 20:13:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:22,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:22,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, 1, 1, 1] [2020-02-10 20:13:22,142 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:22,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:22,142 INFO L82 PathProgramCache]: Analyzing trace with hash 844274742, now seen corresponding path program 69 times [2020-02-10 20:13:22,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:22,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612401895] [2020-02-10 20:13:22,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:22,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612401895] [2020-02-10 20:13:22,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:22,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:22,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315753291] [2020-02-10 20:13:22,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:22,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:22,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:22,680 INFO L87 Difference]: Start difference. First operand 1576 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:13:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:22,857 INFO L93 Difference]: Finished difference Result 2991 states and 11875 transitions. [2020-02-10 20:13:22,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:22,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:22,865 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:13:22,865 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:13:22,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:13:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1582. [2020-02-10 20:13:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:13:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7080 transitions. [2020-02-10 20:13:22,929 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7080 transitions. Word has length 28 [2020-02-10 20:13:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:22,929 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7080 transitions. [2020-02-10 20:13:22,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7080 transitions. [2020-02-10 20:13:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:22,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:22,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:22,932 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1762224932, now seen corresponding path program 70 times [2020-02-10 20:13:22,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:22,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457707888] [2020-02-10 20:13:22,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:23,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457707888] [2020-02-10 20:13:23,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:23,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:23,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378706625] [2020-02-10 20:13:23,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:23,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:23,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:23,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:23,468 INFO L87 Difference]: Start difference. First operand 1582 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:13:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:23,649 INFO L93 Difference]: Finished difference Result 2992 states and 11871 transitions. [2020-02-10 20:13:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:23,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:23,657 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:13:23,657 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:13:23,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:13:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1576. [2020-02-10 20:13:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:13:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 20:13:23,723 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 20:13:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:23,724 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 20:13:23,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 20:13:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:23,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:23,726 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:23,726 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:23,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1260594358, now seen corresponding path program 71 times [2020-02-10 20:13:23,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:23,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122623657] [2020-02-10 20:13:23,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:24,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122623657] [2020-02-10 20:13:24,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:24,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:24,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068178625] [2020-02-10 20:13:24,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:24,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:24,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:24,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:24,271 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:13:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:24,475 INFO L93 Difference]: Finished difference Result 2996 states and 11880 transitions. [2020-02-10 20:13:24,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:24,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:24,483 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:13:24,483 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:13:24,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:13:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1583. [2020-02-10 20:13:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:13:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7076 transitions. [2020-02-10 20:13:24,547 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7076 transitions. Word has length 28 [2020-02-10 20:13:24,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:24,547 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7076 transitions. [2020-02-10 20:13:24,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7076 transitions. [2020-02-10 20:13:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:24,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:24,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:24,550 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:24,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:24,550 INFO L82 PathProgramCache]: Analyzing trace with hash 689139552, now seen corresponding path program 72 times [2020-02-10 20:13:24,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:24,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918005299] [2020-02-10 20:13:24,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:25,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918005299] [2020-02-10 20:13:25,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:25,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:25,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846171882] [2020-02-10 20:13:25,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:25,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:25,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:25,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:25,097 INFO L87 Difference]: Start difference. First operand 1583 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:13:25,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:25,311 INFO L93 Difference]: Finished difference Result 2995 states and 11871 transitions. [2020-02-10 20:13:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:25,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:25,319 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:13:25,319 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:13:25,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:13:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1565. [2020-02-10 20:13:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:13:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7038 transitions. [2020-02-10 20:13:25,385 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7038 transitions. Word has length 28 [2020-02-10 20:13:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:25,385 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7038 transitions. [2020-02-10 20:13:25,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7038 transitions. [2020-02-10 20:13:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:25,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:25,388 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:25,388 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:25,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1952084594, now seen corresponding path program 73 times [2020-02-10 20:13:25,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:25,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040450963] [2020-02-10 20:13:25,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:25,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040450963] [2020-02-10 20:13:25,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:25,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:25,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726892069] [2020-02-10 20:13:25,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:25,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:25,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:25,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:25,927 INFO L87 Difference]: Start difference. First operand 1565 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:13:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:26,100 INFO L93 Difference]: Finished difference Result 3018 states and 11947 transitions. [2020-02-10 20:13:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:26,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:26,108 INFO L225 Difference]: With dead ends: 3018 [2020-02-10 20:13:26,109 INFO L226 Difference]: Without dead ends: 3003 [2020-02-10 20:13:26,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2020-02-10 20:13:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1586. [2020-02-10 20:13:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:13:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7106 transitions. [2020-02-10 20:13:26,174 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7106 transitions. Word has length 28 [2020-02-10 20:13:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:26,174 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7106 transitions. [2020-02-10 20:13:26,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7106 transitions. [2020-02-10 20:13:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:26,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:26,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:26,177 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash -853477706, now seen corresponding path program 74 times [2020-02-10 20:13:26,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:26,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493630849] [2020-02-10 20:13:26,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:26,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493630849] [2020-02-10 20:13:26,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:26,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:26,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322727140] [2020-02-10 20:13:26,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:26,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:26,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:26,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:26,751 INFO L87 Difference]: Start difference. First operand 1586 states and 7106 transitions. Second operand 11 states. [2020-02-10 20:13:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:26,889 INFO L93 Difference]: Finished difference Result 3023 states and 11951 transitions. [2020-02-10 20:13:26,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:26,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:26,897 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 20:13:26,897 INFO L226 Difference]: Without dead ends: 2997 [2020-02-10 20:13:26,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2020-02-10 20:13:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1580. [2020-02-10 20:13:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:13:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7089 transitions. [2020-02-10 20:13:26,963 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7089 transitions. Word has length 28 [2020-02-10 20:13:26,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:26,963 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7089 transitions. [2020-02-10 20:13:26,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7089 transitions. [2020-02-10 20:13:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:26,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13: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, 1, 1, 1] [2020-02-10 20:13:26,966 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash -731941744, now seen corresponding path program 75 times [2020-02-10 20:13:26,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:26,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303702664] [2020-02-10 20:13:26,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:27,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303702664] [2020-02-10 20:13:27,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:27,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:27,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178980231] [2020-02-10 20:13:27,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:27,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:27,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:27,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:27,537 INFO L87 Difference]: Start difference. First operand 1580 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:13:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:27,715 INFO L93 Difference]: Finished difference Result 3015 states and 11936 transitions. [2020-02-10 20:13:27,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:27,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:27,723 INFO L225 Difference]: With dead ends: 3015 [2020-02-10 20:13:27,723 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 20:13:27,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 20:13:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1585. [2020-02-10 20:13:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:13:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7098 transitions. [2020-02-10 20:13:27,788 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7098 transitions. Word has length 28 [2020-02-10 20:13:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:27,788 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7098 transitions. [2020-02-10 20:13:27,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7098 transitions. [2020-02-10 20:13:27,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:27,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:27,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:27,791 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:27,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:27,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1502165750, now seen corresponding path program 76 times [2020-02-10 20:13:27,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:27,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6765233] [2020-02-10 20:13:27,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:28,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6765233] [2020-02-10 20:13:28,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:28,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:28,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649987813] [2020-02-10 20:13:28,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:28,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:28,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:28,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:28,339 INFO L87 Difference]: Start difference. First operand 1585 states and 7098 transitions. Second operand 11 states. [2020-02-10 20:13:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:28,564 INFO L93 Difference]: Finished difference Result 3018 states and 11937 transitions. [2020-02-10 20:13:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:28,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:28,572 INFO L225 Difference]: With dead ends: 3018 [2020-02-10 20:13:28,572 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:13:28,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:13:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1580. [2020-02-10 20:13:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:13:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7084 transitions. [2020-02-10 20:13:28,637 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7084 transitions. Word has length 28 [2020-02-10 20:13:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:28,638 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7084 transitions. [2020-02-10 20:13:28,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7084 transitions. [2020-02-10 20:13:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:28,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:28,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:28,641 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash -315622128, now seen corresponding path program 77 times [2020-02-10 20:13:28,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:28,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638203211] [2020-02-10 20:13:28,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:29,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638203211] [2020-02-10 20:13:29,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:29,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:29,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882147063] [2020-02-10 20:13:29,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:29,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:29,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:29,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:29,180 INFO L87 Difference]: Start difference. First operand 1580 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:13:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:29,343 INFO L93 Difference]: Finished difference Result 3030 states and 11961 transitions. [2020-02-10 20:13:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:29,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:29,350 INFO L225 Difference]: With dead ends: 3030 [2020-02-10 20:13:29,350 INFO L226 Difference]: Without dead ends: 3010 [2020-02-10 20:13:29,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2020-02-10 20:13:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1590. [2020-02-10 20:13:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:13:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7101 transitions. [2020-02-10 20:13:29,416 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7101 transitions. Word has length 28 [2020-02-10 20:13:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:29,416 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7101 transitions. [2020-02-10 20:13:29,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7101 transitions. [2020-02-10 20:13:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:29,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:29,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:29,419 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash 429080370, now seen corresponding path program 78 times [2020-02-10 20:13:29,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:29,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773806039] [2020-02-10 20:13:29,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:29,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773806039] [2020-02-10 20:13:29,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:29,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:29,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872494658] [2020-02-10 20:13:29,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:29,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:29,970 INFO L87 Difference]: Start difference. First operand 1590 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:13:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:30,192 INFO L93 Difference]: Finished difference Result 3028 states and 11949 transitions. [2020-02-10 20:13:30,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:30,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:30,202 INFO L225 Difference]: With dead ends: 3028 [2020-02-10 20:13:30,202 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 20:13:30,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 20:13:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1573. [2020-02-10 20:13:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:13:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7064 transitions. [2020-02-10 20:13:30,266 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7064 transitions. Word has length 28 [2020-02-10 20:13:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:30,267 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7064 transitions. [2020-02-10 20:13:30,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7064 transitions. [2020-02-10 20:13:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:30,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:30,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:30,270 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1755137380, now seen corresponding path program 79 times [2020-02-10 20:13:30,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:30,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521054606] [2020-02-10 20:13:30,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:30,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521054606] [2020-02-10 20:13:30,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:30,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:30,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604394634] [2020-02-10 20:13:30,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:30,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:30,820 INFO L87 Difference]: Start difference. First operand 1573 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:13:31,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:31,007 INFO L93 Difference]: Finished difference Result 3014 states and 11932 transitions. [2020-02-10 20:13:31,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:31,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:31,015 INFO L225 Difference]: With dead ends: 3014 [2020-02-10 20:13:31,015 INFO L226 Difference]: Without dead ends: 2999 [2020-02-10 20:13:31,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2020-02-10 20:13:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1585. [2020-02-10 20:13:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:13:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7097 transitions. [2020-02-10 20:13:31,079 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7097 transitions. Word has length 28 [2020-02-10 20:13:31,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:31,079 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7097 transitions. [2020-02-10 20:13:31,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7097 transitions. [2020-02-10 20:13:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:31,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:31,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:31,082 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:31,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:31,082 INFO L82 PathProgramCache]: Analyzing trace with hash -265732384, now seen corresponding path program 80 times [2020-02-10 20:13:31,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:31,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726168943] [2020-02-10 20:13:31,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:31,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726168943] [2020-02-10 20:13:31,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:31,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:31,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580344081] [2020-02-10 20:13:31,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:31,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:31,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:31,616 INFO L87 Difference]: Start difference. First operand 1585 states and 7097 transitions. Second operand 11 states. [2020-02-10 20:13:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:31,798 INFO L93 Difference]: Finished difference Result 3019 states and 11936 transitions. [2020-02-10 20:13:31,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:31,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:31,806 INFO L225 Difference]: With dead ends: 3019 [2020-02-10 20:13:31,806 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 20:13:31,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 20:13:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1579. [2020-02-10 20:13:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:13:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7080 transitions. [2020-02-10 20:13:31,871 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7080 transitions. Word has length 28 [2020-02-10 20:13:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:31,871 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7080 transitions. [2020-02-10 20:13:31,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7080 transitions. [2020-02-10 20:13:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:31,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:31,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:31,873 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash -679426224, now seen corresponding path program 81 times [2020-02-10 20:13:31,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:31,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722332888] [2020-02-10 20:13:31,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:32,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722332888] [2020-02-10 20:13:32,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:32,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:32,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785862268] [2020-02-10 20:13:32,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:32,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:32,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:32,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:32,407 INFO L87 Difference]: Start difference. First operand 1579 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:13:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:32,600 INFO L93 Difference]: Finished difference Result 3010 states and 11919 transitions. [2020-02-10 20:13:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:32,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:32,607 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 20:13:32,607 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:13:32,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:13:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1584. [2020-02-10 20:13:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:13:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7089 transitions. [2020-02-10 20:13:32,671 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7089 transitions. Word has length 28 [2020-02-10 20:13:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:32,671 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7089 transitions. [2020-02-10 20:13:32,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7089 transitions. [2020-02-10 20:13:32,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:32,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:32,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:32,674 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:32,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:32,674 INFO L82 PathProgramCache]: Analyzing trace with hash 983226464, now seen corresponding path program 82 times [2020-02-10 20:13:32,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:32,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926377748] [2020-02-10 20:13:32,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:33,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926377748] [2020-02-10 20:13:33,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:33,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:33,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979490102] [2020-02-10 20:13:33,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:33,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:33,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:33,206 INFO L87 Difference]: Start difference. First operand 1584 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:13:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:33,392 INFO L93 Difference]: Finished difference Result 3012 states and 11918 transitions. [2020-02-10 20:13:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:33,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:33,400 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:13:33,400 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 20:13:33,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 20:13:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1579. [2020-02-10 20:13:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:13:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7075 transitions. [2020-02-10 20:13:33,465 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7075 transitions. Word has length 28 [2020-02-10 20:13:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:33,465 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7075 transitions. [2020-02-10 20:13:33,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7075 transitions. [2020-02-10 20:13:33,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:33,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:33,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, 1, 1, 1] [2020-02-10 20:13:33,467 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash -263106608, now seen corresponding path program 83 times [2020-02-10 20:13:33,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:33,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402579266] [2020-02-10 20:13:33,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:34,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402579266] [2020-02-10 20:13:34,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:34,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:34,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651151242] [2020-02-10 20:13:34,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:34,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:34,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:34,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:34,003 INFO L87 Difference]: Start difference. First operand 1579 states and 7075 transitions. Second operand 11 states. [2020-02-10 20:13:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:34,194 INFO L93 Difference]: Finished difference Result 3023 states and 11940 transitions. [2020-02-10 20:13:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:34,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:34,202 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 20:13:34,202 INFO L226 Difference]: Without dead ends: 3003 [2020-02-10 20:13:34,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2020-02-10 20:13:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1587. [2020-02-10 20:13:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:13:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7089 transitions. [2020-02-10 20:13:34,266 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7089 transitions. Word has length 28 [2020-02-10 20:13:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:34,267 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7089 transitions. [2020-02-10 20:13:34,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7089 transitions. [2020-02-10 20:13:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:34,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:34,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:34,269 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:34,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash -89858916, now seen corresponding path program 84 times [2020-02-10 20:13:34,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:34,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822469134] [2020-02-10 20:13:34,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:34,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822469134] [2020-02-10 20:13:34,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:34,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:34,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781965218] [2020-02-10 20:13:34,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:34,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:34,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:34,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:34,810 INFO L87 Difference]: Start difference. First operand 1587 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:13:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:35,023 INFO L93 Difference]: Finished difference Result 3020 states and 11927 transitions. [2020-02-10 20:13:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:35,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:35,031 INFO L225 Difference]: With dead ends: 3020 [2020-02-10 20:13:35,032 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:13:35,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:13:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1573. [2020-02-10 20:13:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:13:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7058 transitions. [2020-02-10 20:13:35,097 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7058 transitions. Word has length 28 [2020-02-10 20:13:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:35,097 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7058 transitions. [2020-02-10 20:13:35,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7058 transitions. [2020-02-10 20:13:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:35,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:35,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:35,100 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1744634276, now seen corresponding path program 85 times [2020-02-10 20:13:35,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:35,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275985927] [2020-02-10 20:13:35,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:35,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275985927] [2020-02-10 20:13:35,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:35,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:35,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390059833] [2020-02-10 20:13:35,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:35,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:35,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:35,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:35,633 INFO L87 Difference]: Start difference. First operand 1573 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:13:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:35,821 INFO L93 Difference]: Finished difference Result 3006 states and 11911 transitions. [2020-02-10 20:13:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:35,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:35,829 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:13:35,829 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:13:35,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:13:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1583. [2020-02-10 20:13:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:13:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7086 transitions. [2020-02-10 20:13:35,893 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7086 transitions. Word has length 28 [2020-02-10 20:13:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:35,894 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7086 transitions. [2020-02-10 20:13:35,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7086 transitions. [2020-02-10 20:13:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:35,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:35,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:35,896 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:35,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash 489473218, now seen corresponding path program 86 times [2020-02-10 20:13:35,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:35,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656879823] [2020-02-10 20:13:35,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:36,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656879823] [2020-02-10 20:13:36,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:36,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:36,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887707605] [2020-02-10 20:13:36,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:36,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:36,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:36,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:36,433 INFO L87 Difference]: Start difference. First operand 1583 states and 7086 transitions. Second operand 11 states. [2020-02-10 20:13:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:36,692 INFO L93 Difference]: Finished difference Result 3009 states and 11912 transitions. [2020-02-10 20:13:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:36,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:36,700 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:13:36,700 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 20:13:36,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 20:13:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1578. [2020-02-10 20:13:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:13:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7072 transitions. [2020-02-10 20:13:36,765 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7072 transitions. Word has length 28 [2020-02-10 20:13:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:36,765 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7072 transitions. [2020-02-10 20:13:36,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7072 transitions. [2020-02-10 20:13:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:36,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:36,767 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:36,768 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:36,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:36,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2015103218, now seen corresponding path program 87 times [2020-02-10 20:13:36,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:36,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668577537] [2020-02-10 20:13:36,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:37,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668577537] [2020-02-10 20:13:37,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:37,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:37,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253239781] [2020-02-10 20:13:37,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:37,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:37,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:37,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:37,294 INFO L87 Difference]: Start difference. First operand 1578 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:13:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:37,521 INFO L93 Difference]: Finished difference Result 3005 states and 11904 transitions. [2020-02-10 20:13:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:37,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:37,528 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:13:37,528 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 20:13:37,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 20:13:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1583. [2020-02-10 20:13:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:13:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7081 transitions. [2020-02-10 20:13:37,593 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7081 transitions. Word has length 28 [2020-02-10 20:13:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:37,593 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7081 transitions. [2020-02-10 20:13:37,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7081 transitions. [2020-02-10 20:13:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:37,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:37,595 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:37,595 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:37,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash -617211390, now seen corresponding path program 88 times [2020-02-10 20:13:37,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:37,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914527626] [2020-02-10 20:13:37,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:38,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914527626] [2020-02-10 20:13:38,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:38,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:38,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432604181] [2020-02-10 20:13:38,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:38,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:38,123 INFO L87 Difference]: Start difference. First operand 1583 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:13:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:38,316 INFO L93 Difference]: Finished difference Result 3007 states and 11903 transitions. [2020-02-10 20:13:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:38,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:38,324 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 20:13:38,325 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:13:38,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:38,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:13:38,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1578. [2020-02-10 20:13:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:13:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7067 transitions. [2020-02-10 20:13:38,390 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7067 transitions. Word has length 28 [2020-02-10 20:13:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:38,390 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7067 transitions. [2020-02-10 20:13:38,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7067 transitions. [2020-02-10 20:13:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:38,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:38,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:38,393 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash 492098994, now seen corresponding path program 89 times [2020-02-10 20:13:38,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:38,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626046533] [2020-02-10 20:13:38,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:38,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626046533] [2020-02-10 20:13:38,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:38,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:38,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032933224] [2020-02-10 20:13:38,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:38,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:38,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:38,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:38,935 INFO L87 Difference]: Start difference. First operand 1578 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:13:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:39,119 INFO L93 Difference]: Finished difference Result 3013 states and 11917 transitions. [2020-02-10 20:13:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:39,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:39,127 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 20:13:39,127 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:13:39,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:13:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1585. [2020-02-10 20:13:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:13:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7080 transitions. [2020-02-10 20:13:39,213 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7080 transitions. Word has length 28 [2020-02-10 20:13:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:39,213 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7080 transitions. [2020-02-10 20:13:39,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7080 transitions. [2020-02-10 20:13:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:39,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:39,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:39,216 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:39,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:39,216 INFO L82 PathProgramCache]: Analyzing trace with hash -79355812, now seen corresponding path program 90 times [2020-02-10 20:13:39,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:39,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557129820] [2020-02-10 20:13:39,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:39,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557129820] [2020-02-10 20:13:39,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:39,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:39,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590297048] [2020-02-10 20:13:39,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:39,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:39,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:39,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:39,749 INFO L87 Difference]: Start difference. First operand 1585 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:13:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:39,961 INFO L93 Difference]: Finished difference Result 3012 states and 11908 transitions. [2020-02-10 20:13:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:39,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:39,969 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:13:39,969 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:13:39,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:13:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1573. [2020-02-10 20:13:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:13:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7053 transitions. [2020-02-10 20:13:40,033 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7053 transitions. Word has length 28 [2020-02-10 20:13:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,033 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7053 transitions. [2020-02-10 20:13:40,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7053 transitions. [2020-02-10 20:13:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:40,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:40,037 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash -234223072, now seen corresponding path program 91 times [2020-02-10 20:13:40,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266803002] [2020-02-10 20:13:40,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:40,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266803002] [2020-02-10 20:13:40,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:40,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:40,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739295227] [2020-02-10 20:13:40,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:40,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:40,638 INFO L87 Difference]: Start difference. First operand 1573 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:13:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:40,773 INFO L93 Difference]: Finished difference Result 3039 states and 11979 transitions. [2020-02-10 20:13:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:40,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:40,781 INFO L225 Difference]: With dead ends: 3039 [2020-02-10 20:13:40,781 INFO L226 Difference]: Without dead ends: 3019 [2020-02-10 20:13:40,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2020-02-10 20:13:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 1593. [2020-02-10 20:13:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 20:13:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7103 transitions. [2020-02-10 20:13:40,846 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7103 transitions. Word has length 28 [2020-02-10 20:13:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,846 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7103 transitions. [2020-02-10 20:13:40,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7103 transitions. [2020-02-10 20:13:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:40,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:40,849 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,849 INFO L82 PathProgramCache]: Analyzing trace with hash 510479426, now seen corresponding path program 92 times [2020-02-10 20:13:40,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307858823] [2020-02-10 20:13:40,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:41,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307858823] [2020-02-10 20:13:41,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:41,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:41,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977940959] [2020-02-10 20:13:41,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:41,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:41,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:41,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:41,434 INFO L87 Difference]: Start difference. First operand 1593 states and 7103 transitions. Second operand 11 states. [2020-02-10 20:13:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:41,606 INFO L93 Difference]: Finished difference Result 3037 states and 11967 transitions. [2020-02-10 20:13:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:41,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:41,614 INFO L225 Difference]: With dead ends: 3037 [2020-02-10 20:13:41,614 INFO L226 Difference]: Without dead ends: 3009 [2020-02-10 20:13:41,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2020-02-10 20:13:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 1583. [2020-02-10 20:13:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:13:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7077 transitions. [2020-02-10 20:13:41,680 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7077 transitions. Word has length 28 [2020-02-10 20:13:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:41,680 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7077 transitions. [2020-02-10 20:13:41,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7077 transitions. [2020-02-10 20:13:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:41,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:41,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:41,683 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash -769452874, now seen corresponding path program 93 times [2020-02-10 20:13:41,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:41,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876221697] [2020-02-10 20:13:41,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:42,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876221697] [2020-02-10 20:13:42,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:42,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:42,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947085699] [2020-02-10 20:13:42,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:42,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:42,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:42,239 INFO L87 Difference]: Start difference. First operand 1583 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:13:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:42,398 INFO L93 Difference]: Finished difference Result 3036 states and 11964 transitions. [2020-02-10 20:13:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:42,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:42,406 INFO L225 Difference]: With dead ends: 3036 [2020-02-10 20:13:42,406 INFO L226 Difference]: Without dead ends: 3016 [2020-02-10 20:13:42,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2020-02-10 20:13:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 1591. [2020-02-10 20:13:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:13:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7091 transitions. [2020-02-10 20:13:42,479 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7091 transitions. Word has length 28 [2020-02-10 20:13:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:42,479 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7091 transitions. [2020-02-10 20:13:42,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7091 transitions. [2020-02-10 20:13:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:42,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:42,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:42,482 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash -596205182, now seen corresponding path program 94 times [2020-02-10 20:13:42,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:42,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637422755] [2020-02-10 20:13:42,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:43,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-02-10 20:13:43,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637422755] [2020-02-10 20:13:43,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:43,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:43,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138001767] [2020-02-10 20:13:43,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:43,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:43,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:43,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:43,123 INFO L87 Difference]: Start difference. First operand 1591 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:13:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:43,307 INFO L93 Difference]: Finished difference Result 3033 states and 11951 transitions. [2020-02-10 20:13:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:43,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:43,315 INFO L225 Difference]: With dead ends: 3033 [2020-02-10 20:13:43,315 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 20:13:43,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:43,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 20:13:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1583. [2020-02-10 20:13:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:13:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7069 transitions. [2020-02-10 20:13:43,384 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7069 transitions. Word has length 28 [2020-02-10 20:13:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:43,384 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7069 transitions. [2020-02-10 20:13:43,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7069 transitions. [2020-02-10 20:13:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:43,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:43,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:43,387 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1586190582, now seen corresponding path program 95 times [2020-02-10 20:13:43,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:43,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640857422] [2020-02-10 20:13:43,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:43,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640857422] [2020-02-10 20:13:43,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:43,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:43,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671092974] [2020-02-10 20:13:43,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:43,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:43,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:43,960 INFO L87 Difference]: Start difference. First operand 1583 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:13:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:44,151 INFO L93 Difference]: Finished difference Result 3031 states and 11948 transitions. [2020-02-10 20:13:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:44,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:44,159 INFO L225 Difference]: With dead ends: 3031 [2020-02-10 20:13:44,160 INFO L226 Difference]: Without dead ends: 3013 [2020-02-10 20:13:44,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2020-02-10 20:13:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 1590. [2020-02-10 20:13:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:13:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7082 transitions. [2020-02-10 20:13:44,224 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7082 transitions. Word has length 28 [2020-02-10 20:13:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:44,224 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7082 transitions. [2020-02-10 20:13:44,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7082 transitions. [2020-02-10 20:13:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:44,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:44,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:44,227 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:44,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:44,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1014735776, now seen corresponding path program 96 times [2020-02-10 20:13:44,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:44,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795795830] [2020-02-10 20:13:44,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:44,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795795830] [2020-02-10 20:13:44,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:44,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:44,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077172985] [2020-02-10 20:13:44,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:44,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:44,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:44,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:44,771 INFO L87 Difference]: Start difference. First operand 1590 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:13:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:44,961 INFO L93 Difference]: Finished difference Result 3030 states and 11939 transitions. [2020-02-10 20:13:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:44,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:44,968 INFO L225 Difference]: With dead ends: 3030 [2020-02-10 20:13:44,969 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 20:13:44,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 20:13:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1565. [2020-02-10 20:13:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:13:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7030 transitions. [2020-02-10 20:13:45,033 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7030 transitions. Word has length 28 [2020-02-10 20:13:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:45,033 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7030 transitions. [2020-02-10 20:13:45,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7030 transitions. [2020-02-10 20:13:45,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:45,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:45,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:45,036 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:45,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:45,036 INFO L82 PathProgramCache]: Analyzing trace with hash 338356978, now seen corresponding path program 97 times [2020-02-10 20:13:45,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:45,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194928196] [2020-02-10 20:13:45,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:45,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194928196] [2020-02-10 20:13:45,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:45,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:45,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122073777] [2020-02-10 20:13:45,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:45,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:45,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:45,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:45,588 INFO L87 Difference]: Start difference. First operand 1565 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:13:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:45,759 INFO L93 Difference]: Finished difference Result 3034 states and 11987 transitions. [2020-02-10 20:13:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:45,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:45,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:45,767 INFO L225 Difference]: With dead ends: 3034 [2020-02-10 20:13:45,767 INFO L226 Difference]: Without dead ends: 3018 [2020-02-10 20:13:45,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-02-10 20:13:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 1590. [2020-02-10 20:13:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:13:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7110 transitions. [2020-02-10 20:13:45,832 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7110 transitions. Word has length 28 [2020-02-10 20:13:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:45,832 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7110 transitions. [2020-02-10 20:13:45,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7110 transitions. [2020-02-10 20:13:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:45,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:45,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:45,835 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1083059476, now seen corresponding path program 98 times [2020-02-10 20:13:45,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:45,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228533445] [2020-02-10 20:13:45,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:46,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228533445] [2020-02-10 20:13:46,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:46,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:46,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112497459] [2020-02-10 20:13:46,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:46,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:46,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:46,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:46,392 INFO L87 Difference]: Start difference. First operand 1590 states and 7110 transitions. Second operand 11 states. [2020-02-10 20:13:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:46,542 INFO L93 Difference]: Finished difference Result 3038 states and 11988 transitions. [2020-02-10 20:13:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:46,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:46,550 INFO L225 Difference]: With dead ends: 3038 [2020-02-10 20:13:46,550 INFO L226 Difference]: Without dead ends: 3011 [2020-02-10 20:13:46,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2020-02-10 20:13:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 1583. [2020-02-10 20:13:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:13:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7090 transitions. [2020-02-10 20:13:46,614 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7090 transitions. Word has length 28 [2020-02-10 20:13:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:46,615 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7090 transitions. [2020-02-10 20:13:46,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7090 transitions. [2020-02-10 20:13:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:46,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:46,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:46,617 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:46,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:46,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1949297936, now seen corresponding path program 99 times [2020-02-10 20:13:46,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:46,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733039717] [2020-02-10 20:13:46,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:47,156 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:13:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:47,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733039717] [2020-02-10 20:13:47,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:47,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:47,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610664989] [2020-02-10 20:13:47,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:47,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:47,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:47,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:47,164 INFO L87 Difference]: Start difference. First operand 1583 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:13:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:47,400 INFO L93 Difference]: Finished difference Result 3031 states and 11975 transitions. [2020-02-10 20:13:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:47,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:47,408 INFO L225 Difference]: With dead ends: 3031 [2020-02-10 20:13:47,409 INFO L226 Difference]: Without dead ends: 3015 [2020-02-10 20:13:47,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2020-02-10 20:13:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 1589. [2020-02-10 20:13:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 20:13:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7101 transitions. [2020-02-10 20:13:47,473 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7101 transitions. Word has length 28 [2020-02-10 20:13:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:47,473 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7101 transitions. [2020-02-10 20:13:47,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7101 transitions. [2020-02-10 20:13:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:47,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:47,476 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:47,476 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash -856264364, now seen corresponding path program 100 times [2020-02-10 20:13:47,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:47,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153316118] [2020-02-10 20:13:47,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:48,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153316118] [2020-02-10 20:13:48,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:48,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:48,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502710779] [2020-02-10 20:13:48,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:48,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:48,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:48,037 INFO L87 Difference]: Start difference. First operand 1589 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:13:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:48,241 INFO L93 Difference]: Finished difference Result 3033 states and 11973 transitions. [2020-02-10 20:13:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:48,241 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:48,248 INFO L225 Difference]: With dead ends: 3033 [2020-02-10 20:13:48,249 INFO L226 Difference]: Without dead ends: 3009 [2020-02-10 20:13:48,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2020-02-10 20:13:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 1583. [2020-02-10 20:13:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:13:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7084 transitions. [2020-02-10 20:13:48,313 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7084 transitions. Word has length 28 [2020-02-10 20:13:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:48,313 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7084 transitions. [2020-02-10 20:13:48,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7084 transitions. [2020-02-10 20:13:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:48,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:48,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:48,316 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash 9974096, now seen corresponding path program 101 times [2020-02-10 20:13:48,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:48,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753501629] [2020-02-10 20:13:48,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:48,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753501629] [2020-02-10 20:13:48,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:48,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:48,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603481744] [2020-02-10 20:13:48,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:48,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:48,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:48,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:48,886 INFO L87 Difference]: Start difference. First operand 1583 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:13:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:49,052 INFO L93 Difference]: Finished difference Result 3043 states and 11992 transitions. [2020-02-10 20:13:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:49,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:49,060 INFO L225 Difference]: With dead ends: 3043 [2020-02-10 20:13:49,060 INFO L226 Difference]: Without dead ends: 3023 [2020-02-10 20:13:49,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2020-02-10 20:13:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 1593. [2020-02-10 20:13:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 20:13:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7101 transitions. [2020-02-10 20:13:49,125 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7101 transitions. Word has length 28 [2020-02-10 20:13:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:49,125 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7101 transitions. [2020-02-10 20:13:49,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7101 transitions. [2020-02-10 20:13:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:49,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:49,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:49,128 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:49,128 INFO L82 PathProgramCache]: Analyzing trace with hash 754676594, now seen corresponding path program 102 times [2020-02-10 20:13:49,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:49,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735565941] [2020-02-10 20:13:49,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:49,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735565941] [2020-02-10 20:13:49,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:49,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:49,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359565419] [2020-02-10 20:13:49,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:49,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:49,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:49,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:49,801 INFO L87 Difference]: Start difference. First operand 1593 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:13:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:49,979 INFO L93 Difference]: Finished difference Result 3041 states and 11980 transitions. [2020-02-10 20:13:49,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:49,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:49,988 INFO L225 Difference]: With dead ends: 3041 [2020-02-10 20:13:49,988 INFO L226 Difference]: Without dead ends: 3005 [2020-02-10 20:13:49,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2020-02-10 20:13:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1575. [2020-02-10 20:13:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:13:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7061 transitions. [2020-02-10 20:13:50,053 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7061 transitions. Word has length 28 [2020-02-10 20:13:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:50,053 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7061 transitions. [2020-02-10 20:13:50,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7061 transitions. [2020-02-10 20:13:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:50,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:50,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:50,056 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:50,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:50,056 INFO L82 PathProgramCache]: Analyzing trace with hash 926102300, now seen corresponding path program 103 times [2020-02-10 20:13:50,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:50,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698565269] [2020-02-10 20:13:50,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:50,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698565269] [2020-02-10 20:13:50,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:50,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:50,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881382563] [2020-02-10 20:13:50,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:50,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:50,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:50,596 INFO L87 Difference]: Start difference. First operand 1575 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:13:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:50,829 INFO L93 Difference]: Finished difference Result 3030 states and 11971 transitions. [2020-02-10 20:13:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:50,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:50,837 INFO L225 Difference]: With dead ends: 3030 [2020-02-10 20:13:50,837 INFO L226 Difference]: Without dead ends: 3014 [2020-02-10 20:13:50,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2020-02-10 20:13:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 1589. [2020-02-10 20:13:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 20:13:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7100 transitions. [2020-02-10 20:13:50,902 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7100 transitions. Word has length 28 [2020-02-10 20:13:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:50,902 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7100 transitions. [2020-02-10 20:13:50,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7100 transitions. [2020-02-10 20:13:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:50,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:50,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:50,905 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:50,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:50,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1670804798, now seen corresponding path program 104 times [2020-02-10 20:13:50,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:50,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625981602] [2020-02-10 20:13:50,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:51,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625981602] [2020-02-10 20:13:51,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:51,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:51,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386555046] [2020-02-10 20:13:51,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:51,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:51,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:51,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:51,441 INFO L87 Difference]: Start difference. First operand 1589 states and 7100 transitions. Second operand 11 states. [2020-02-10 20:13:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:51,618 INFO L93 Difference]: Finished difference Result 3034 states and 11972 transitions. [2020-02-10 20:13:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:51,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:51,626 INFO L225 Difference]: With dead ends: 3034 [2020-02-10 20:13:51,626 INFO L226 Difference]: Without dead ends: 3007 [2020-02-10 20:13:51,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2020-02-10 20:13:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 1582. [2020-02-10 20:13:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:13:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7080 transitions. [2020-02-10 20:13:51,692 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7080 transitions. Word has length 28 [2020-02-10 20:13:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:51,692 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7080 transitions. [2020-02-10 20:13:51,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7080 transitions. [2020-02-10 20:13:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:51,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:51,695 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:51,695 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:51,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:51,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2001813456, now seen corresponding path program 105 times [2020-02-10 20:13:51,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:51,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33098577] [2020-02-10 20:13:51,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:52,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33098577] [2020-02-10 20:13:52,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:52,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:52,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861332744] [2020-02-10 20:13:52,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:52,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:52,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:52,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:52,244 INFO L87 Difference]: Start difference. First operand 1582 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:13:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:52,476 INFO L93 Difference]: Finished difference Result 3026 states and 11957 transitions. [2020-02-10 20:13:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:52,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:52,483 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 20:13:52,483 INFO L226 Difference]: Without dead ends: 3010 [2020-02-10 20:13:52,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2020-02-10 20:13:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1588. [2020-02-10 20:13:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:13:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7091 transitions. [2020-02-10 20:13:52,568 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7091 transitions. Word has length 28 [2020-02-10 20:13:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:52,568 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7091 transitions. [2020-02-10 20:13:52,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7091 transitions. [2020-02-10 20:13:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:52,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:52,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:52,571 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:52,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1375203650, now seen corresponding path program 106 times [2020-02-10 20:13:52,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:52,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697341435] [2020-02-10 20:13:52,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13: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-02-10 20:13:53,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697341435] [2020-02-10 20:13:53,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:53,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:53,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133791752] [2020-02-10 20:13:53,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:53,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:53,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:53,120 INFO L87 Difference]: Start difference. First operand 1588 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:13:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:53,302 INFO L93 Difference]: Finished difference Result 3027 states and 11953 transitions. [2020-02-10 20:13:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:53,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:53,310 INFO L225 Difference]: With dead ends: 3027 [2020-02-10 20:13:53,310 INFO L226 Difference]: Without dead ends: 3004 [2020-02-10 20:13:53,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2020-02-10 20:13:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 1582. [2020-02-10 20:13:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:13:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7074 transitions. [2020-02-10 20:13:53,376 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7074 transitions. Word has length 28 [2020-02-10 20:13:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:53,376 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7074 transitions. [2020-02-10 20:13:53,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7074 transitions. [2020-02-10 20:13:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:53,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:53,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:53,379 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash 62489616, now seen corresponding path program 107 times [2020-02-10 20:13:53,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:53,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660249810] [2020-02-10 20:13:53,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:53,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660249810] [2020-02-10 20:13:53,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:53,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:53,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513372077] [2020-02-10 20:13:53,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:53,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:53,943 INFO L87 Difference]: Start difference. First operand 1582 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:13:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:54,095 INFO L93 Difference]: Finished difference Result 3036 states and 11970 transitions. [2020-02-10 20:13:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:54,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:54,103 INFO L225 Difference]: With dead ends: 3036 [2020-02-10 20:13:54,103 INFO L226 Difference]: Without dead ends: 3016 [2020-02-10 20:13:54,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2020-02-10 20:13:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 1590. [2020-02-10 20:13:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:13:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7088 transitions. [2020-02-10 20:13:54,168 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7088 transitions. Word has length 28 [2020-02-10 20:13:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:54,168 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7088 transitions. [2020-02-10 20:13:54,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7088 transitions. [2020-02-10 20:13:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:54,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:54,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:54,170 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash 235737308, now seen corresponding path program 108 times [2020-02-10 20:13:54,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:54,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727108765] [2020-02-10 20:13:54,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:54,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727108765] [2020-02-10 20:13:54,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:54,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:54,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110289792] [2020-02-10 20:13:54,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:54,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:54,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:54,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:54,720 INFO L87 Difference]: Start difference. First operand 1590 states and 7088 transitions. Second operand 11 states. [2020-02-10 20:13:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:54,915 INFO L93 Difference]: Finished difference Result 3033 states and 11957 transitions. [2020-02-10 20:13:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:54,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:54,923 INFO L225 Difference]: With dead ends: 3033 [2020-02-10 20:13:54,923 INFO L226 Difference]: Without dead ends: 3001 [2020-02-10 20:13:54,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2020-02-10 20:13:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 1575. [2020-02-10 20:13:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:13:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7054 transitions. [2020-02-10 20:13:54,987 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7054 transitions. Word has length 28 [2020-02-10 20:13:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:54,987 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7054 transitions. [2020-02-10 20:13:54,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7054 transitions. [2020-02-10 20:13:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:54,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13: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, 1, 1, 1] [2020-02-10 20:13:54,990 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash 936605404, now seen corresponding path program 109 times [2020-02-10 20:13:54,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:54,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297468456] [2020-02-10 20:13:54,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:55,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297468456] [2020-02-10 20:13:55,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:55,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:55,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244896030] [2020-02-10 20:13:55,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:55,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:55,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:55,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:55,538 INFO L87 Difference]: Start difference. First operand 1575 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:13:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:55,782 INFO L93 Difference]: Finished difference Result 3022 states and 11949 transitions. [2020-02-10 20:13:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:55,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:55,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:55,790 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 20:13:55,790 INFO L226 Difference]: Without dead ends: 3006 [2020-02-10 20:13:55,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2020-02-10 20:13:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 1587. [2020-02-10 20:13:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:13:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7088 transitions. [2020-02-10 20:13:55,855 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7088 transitions. Word has length 28 [2020-02-10 20:13:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:55,855 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7088 transitions. [2020-02-10 20:13:55,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7088 transitions. [2020-02-10 20:13:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:55,857 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:55,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:55,857 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:55,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1868956896, now seen corresponding path program 110 times [2020-02-10 20:13:55,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:55,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791716311] [2020-02-10 20:13:55,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:56,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791716311] [2020-02-10 20:13:56,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:56,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:56,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8666149] [2020-02-10 20:13:56,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:56,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:56,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:56,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:56,396 INFO L87 Difference]: Start difference. First operand 1587 states and 7088 transitions. Second operand 11 states. [2020-02-10 20:13:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:56,625 INFO L93 Difference]: Finished difference Result 3024 states and 11947 transitions. [2020-02-10 20:13:56,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:56,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:56,633 INFO L225 Difference]: With dead ends: 3024 [2020-02-10 20:13:56,633 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 20:13:56,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 20:13:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1581. [2020-02-10 20:13:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:13:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7071 transitions. [2020-02-10 20:13:56,698 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7071 transitions. Word has length 28 [2020-02-10 20:13:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:56,698 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7071 transitions. [2020-02-10 20:13:56,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7071 transitions. [2020-02-10 20:13:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:56,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:56,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:56,701 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:56,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:56,701 INFO L82 PathProgramCache]: Analyzing trace with hash 401375602, now seen corresponding path program 111 times [2020-02-10 20:13:56,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:56,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881241834] [2020-02-10 20:13:56,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:57,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881241834] [2020-02-10 20:13:57,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:57,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:57,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606653709] [2020-02-10 20:13:57,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:57,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:57,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:57,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:57,278 INFO L87 Difference]: Start difference. First operand 1581 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:13:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:57,463 INFO L93 Difference]: Finished difference Result 3021 states and 11941 transitions. [2020-02-10 20:13:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:57,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:57,470 INFO L225 Difference]: With dead ends: 3021 [2020-02-10 20:13:57,470 INFO L226 Difference]: Without dead ends: 3005 [2020-02-10 20:13:57,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2020-02-10 20:13:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1587. [2020-02-10 20:13:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:13:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7082 transitions. [2020-02-10 20:13:57,535 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7082 transitions. Word has length 28 [2020-02-10 20:13:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:57,535 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7082 transitions. [2020-02-10 20:13:57,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7082 transitions. [2020-02-10 20:13:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:57,537 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:57,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:57,538 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:57,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1319325792, now seen corresponding path program 112 times [2020-02-10 20:13:57,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:57,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459916833] [2020-02-10 20:13:57,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:58,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459916833] [2020-02-10 20:13:58,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:58,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:58,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968162935] [2020-02-10 20:13:58,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:58,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:58,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:58,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:58,074 INFO L87 Difference]: Start difference. First operand 1587 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:13:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:58,260 INFO L93 Difference]: Finished difference Result 3022 states and 11937 transitions. [2020-02-10 20:13:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:58,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:58,268 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 20:13:58,268 INFO L226 Difference]: Without dead ends: 2999 [2020-02-10 20:13:58,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2020-02-10 20:13:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1581. [2020-02-10 20:13:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:13:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7065 transitions. [2020-02-10 20:13:58,332 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7065 transitions. Word has length 28 [2020-02-10 20:13:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:58,332 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7065 transitions. [2020-02-10 20:13:58,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7065 transitions. [2020-02-10 20:13:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:58,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:58,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:58,335 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash 817695218, now seen corresponding path program 113 times [2020-02-10 20:13:58,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:58,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306962248] [2020-02-10 20:13:58,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:58,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306962248] [2020-02-10 20:13:58,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:58,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:58,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116392307] [2020-02-10 20:13:58,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:58,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:58,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:58,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:58,884 INFO L87 Difference]: Start difference. First operand 1581 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:13:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:59,096 INFO L93 Difference]: Finished difference Result 3026 states and 11946 transitions. [2020-02-10 20:13:59,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:59,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:59,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:59,103 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 20:13:59,104 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 20:13:59,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 20:13:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1588. [2020-02-10 20:13:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:13:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7078 transitions. [2020-02-10 20:13:59,170 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7078 transitions. Word has length 28 [2020-02-10 20:13:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:59,170 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7078 transitions. [2020-02-10 20:13:59,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7078 transitions. [2020-02-10 20:13:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:59,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:59,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:59,172 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:59,173 INFO L82 PathProgramCache]: Analyzing trace with hash 246240412, now seen corresponding path program 114 times [2020-02-10 20:13:59,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:59,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196104796] [2020-02-10 20:13:59,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:59,713 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:13:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:59,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196104796] [2020-02-10 20:13:59,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:59,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:13:59,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942191106] [2020-02-10 20:13:59,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:13:59,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:59,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:13:59,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:59,721 INFO L87 Difference]: Start difference. First operand 1588 states and 7078 transitions. Second operand 11 states. [2020-02-10 20:13:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:59,922 INFO L93 Difference]: Finished difference Result 3025 states and 11937 transitions. [2020-02-10 20:13:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:13:59,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:13:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:59,930 INFO L225 Difference]: With dead ends: 3025 [2020-02-10 20:13:59,930 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:13:59,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:13:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:13:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1575. [2020-02-10 20:13:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:13:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7048 transitions. [2020-02-10 20:13:59,996 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7048 transitions. Word has length 28 [2020-02-10 20:13:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:59,996 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7048 transitions. [2020-02-10 20:13:59,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:13:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7048 transitions. [2020-02-10 20:13:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:13:59,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:59,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:59,999 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:00,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:00,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1691811006, now seen corresponding path program 115 times [2020-02-10 20:14:00,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:00,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860126604] [2020-02-10 20:14:00,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:00,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860126604] [2020-02-10 20:14:00,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:00,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:00,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502298675] [2020-02-10 20:14:00,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:00,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:00,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:00,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:00,574 INFO L87 Difference]: Start difference. First operand 1575 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:14:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:00,747 INFO L93 Difference]: Finished difference Result 3048 states and 11997 transitions. [2020-02-10 20:14:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:00,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:00,755 INFO L225 Difference]: With dead ends: 3048 [2020-02-10 20:14:00,755 INFO L226 Difference]: Without dead ends: 3028 [2020-02-10 20:14:00,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2020-02-10 20:14:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 1595. [2020-02-10 20:14:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2020-02-10 20:14:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 7098 transitions. [2020-02-10 20:14:00,820 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 7098 transitions. Word has length 28 [2020-02-10 20:14:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:00,820 INFO L479 AbstractCegarLoop]: Abstraction has 1595 states and 7098 transitions. [2020-02-10 20:14:00,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 7098 transitions. [2020-02-10 20:14:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:00,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:00,822 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:00,822 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:00,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1858453792, now seen corresponding path program 116 times [2020-02-10 20:14:00,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:00,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995156017] [2020-02-10 20:14:00,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:01,409 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:14:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:01,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995156017] [2020-02-10 20:14:01,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:01,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:01,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550963252] [2020-02-10 20:14:01,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:01,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:01,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:01,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:01,418 INFO L87 Difference]: Start difference. First operand 1595 states and 7098 transitions. Second operand 11 states. [2020-02-10 20:14:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:01,606 INFO L93 Difference]: Finished difference Result 3046 states and 11985 transitions. [2020-02-10 20:14:01,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:01,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:01,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:01,614 INFO L225 Difference]: With dead ends: 3046 [2020-02-10 20:14:01,614 INFO L226 Difference]: Without dead ends: 3018 [2020-02-10 20:14:01,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-02-10 20:14:01,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 1585. [2020-02-10 20:14:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:14:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7072 transitions. [2020-02-10 20:14:01,682 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7072 transitions. Word has length 28 [2020-02-10 20:14:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:01,682 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7072 transitions. [2020-02-10 20:14:01,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7072 transitions. [2020-02-10 20:14:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:01,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:01,684 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:01,684 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:01,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1156581204, now seen corresponding path program 117 times [2020-02-10 20:14:01,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:01,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841961764] [2020-02-10 20:14:01,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:02,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841961764] [2020-02-10 20:14:02,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:02,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:02,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584017276] [2020-02-10 20:14:02,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:02,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:02,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:02,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:02,241 INFO L87 Difference]: Start difference. First operand 1585 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:14:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:02,410 INFO L93 Difference]: Finished difference Result 3045 states and 11982 transitions. [2020-02-10 20:14:02,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:02,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:02,417 INFO L225 Difference]: With dead ends: 3045 [2020-02-10 20:14:02,417 INFO L226 Difference]: Without dead ends: 3025 [2020-02-10 20:14:02,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2020-02-10 20:14:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 1593. [2020-02-10 20:14:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 20:14:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7086 transitions. [2020-02-10 20:14:02,483 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7086 transitions. Word has length 28 [2020-02-10 20:14:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:02,484 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7086 transitions. [2020-02-10 20:14:02,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7086 transitions. [2020-02-10 20:14:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:02,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:02,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:02,486 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1329828896, now seen corresponding path program 118 times [2020-02-10 20:14:02,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:02,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705609395] [2020-02-10 20:14:02,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:03,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705609395] [2020-02-10 20:14:03,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:03,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:03,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659233679] [2020-02-10 20:14:03,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:03,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:03,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:03,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:03,163 INFO L87 Difference]: Start difference. First operand 1593 states and 7086 transitions. Second operand 11 states. [2020-02-10 20:14:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:03,372 INFO L93 Difference]: Finished difference Result 3042 states and 11969 transitions. [2020-02-10 20:14:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:03,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:03,380 INFO L225 Difference]: With dead ends: 3042 [2020-02-10 20:14:03,380 INFO L226 Difference]: Without dead ends: 3017 [2020-02-10 20:14:03,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2020-02-10 20:14:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 1585. [2020-02-10 20:14:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:14:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7064 transitions. [2020-02-10 20:14:03,447 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7064 transitions. Word has length 28 [2020-02-10 20:14:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:03,447 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7064 transitions. [2020-02-10 20:14:03,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7064 transitions. [2020-02-10 20:14:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:03,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:03,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:03,450 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:03,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:03,450 INFO L82 PathProgramCache]: Analyzing trace with hash -782742636, now seen corresponding path program 119 times [2020-02-10 20:14:03,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:03,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828217355] [2020-02-10 20:14:03,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:04,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828217355] [2020-02-10 20:14:04,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:04,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479539880] [2020-02-10 20:14:04,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:04,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:04,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:04,009 INFO L87 Difference]: Start difference. First operand 1585 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:14:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:04,242 INFO L93 Difference]: Finished difference Result 3040 states and 11966 transitions. [2020-02-10 20:14:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:04,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:04,250 INFO L225 Difference]: With dead ends: 3040 [2020-02-10 20:14:04,251 INFO L226 Difference]: Without dead ends: 3022 [2020-02-10 20:14:04,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-02-10 20:14:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 1592. [2020-02-10 20:14:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2020-02-10 20:14:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 7077 transitions. [2020-02-10 20:14:04,315 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 7077 transitions. Word has length 28 [2020-02-10 20:14:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:04,316 INFO L479 AbstractCegarLoop]: Abstraction has 1592 states and 7077 transitions. [2020-02-10 20:14:04,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 7077 transitions. [2020-02-10 20:14:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:04,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:04,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:04,318 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:04,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1354197442, now seen corresponding path program 120 times [2020-02-10 20:14:04,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:04,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813226894] [2020-02-10 20:14:04,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:04,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813226894] [2020-02-10 20:14:04,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:04,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092601953] [2020-02-10 20:14:04,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:04,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:04,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:04,871 INFO L87 Difference]: Start difference. First operand 1592 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:14:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:05,145 INFO L93 Difference]: Finished difference Result 3039 states and 11957 transitions. [2020-02-10 20:14:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:05,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:05,153 INFO L225 Difference]: With dead ends: 3039 [2020-02-10 20:14:05,153 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:14:05,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:14:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1555. [2020-02-10 20:14:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 20:14:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 7003 transitions. [2020-02-10 20:14:05,218 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 7003 transitions. Word has length 28 [2020-02-10 20:14:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:05,219 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 7003 transitions. [2020-02-10 20:14:05,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 7003 transitions. [2020-02-10 20:14:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:05,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:05,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, 1, 1, 1] [2020-02-10 20:14:05,222 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1151658060, now seen corresponding path program 121 times [2020-02-10 20:14:05,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:05,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491017004] [2020-02-10 20:14:05,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:05,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491017004] [2020-02-10 20:14:05,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:05,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:05,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589096041] [2020-02-10 20:14:05,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:05,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:05,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:05,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:05,762 INFO L87 Difference]: Start difference. First operand 1555 states and 7003 transitions. Second operand 11 states. [2020-02-10 20:14:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:06,032 INFO L93 Difference]: Finished difference Result 2966 states and 11803 transitions. [2020-02-10 20:14:06,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:06,032 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:06,060 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:14:06,060 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:14:06,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:14:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1579. [2020-02-10 20:14:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:14:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7097 transitions. [2020-02-10 20:14:06,123 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7097 transitions. Word has length 28 [2020-02-10 20:14:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,123 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7097 transitions. [2020-02-10 20:14:06,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7097 transitions. [2020-02-10 20:14:06,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:06,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:06,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:06,126 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:06,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1896360558, now seen corresponding path program 122 times [2020-02-10 20:14:06,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:06,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143032565] [2020-02-10 20:14:06,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:06,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143032565] [2020-02-10 20:14:06,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:06,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:06,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991823538] [2020-02-10 20:14:06,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:06,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:06,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:06,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:06,679 INFO L87 Difference]: Start difference. First operand 1579 states and 7097 transitions. Second operand 11 states. [2020-02-10 20:14:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:06,926 INFO L93 Difference]: Finished difference Result 2967 states and 11800 transitions. [2020-02-10 20:14:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:06,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:06,934 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:14:06,934 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:14:06,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:14:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1574. [2020-02-10 20:14:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:14:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7083 transitions. [2020-02-10 20:14:06,999 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7083 transitions. Word has length 28 [2020-02-10 20:14:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,999 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7083 transitions. [2020-02-10 20:14:06,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7083 transitions. [2020-02-10 20:14:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:07,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14: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, 1, 1, 1] [2020-02-10 20:14:07,002 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:07,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:07,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1532368278, now seen corresponding path program 123 times [2020-02-10 20:14:07,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:07,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417712510] [2020-02-10 20:14:07,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:07,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417712510] [2020-02-10 20:14:07,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:07,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:07,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34441705] [2020-02-10 20:14:07,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:07,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:07,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:07,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:07,534 INFO L87 Difference]: Start difference. First operand 1574 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:14:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:07,774 INFO L93 Difference]: Finished difference Result 2971 states and 11807 transitions. [2020-02-10 20:14:07,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:07,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:07,782 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 20:14:07,783 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:14:07,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:14:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1580. [2020-02-10 20:14:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:14:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7094 transitions. [2020-02-10 20:14:07,847 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7094 transitions. Word has length 28 [2020-02-10 20:14:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:07,847 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7094 transitions. [2020-02-10 20:14:07,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7094 transitions. [2020-02-10 20:14:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:07,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:07,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:07,849 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:07,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash -42963282, now seen corresponding path program 124 times [2020-02-10 20:14:07,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:07,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545141808] [2020-02-10 20:14:07,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:08,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545141808] [2020-02-10 20:14:08,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:08,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:08,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573937214] [2020-02-10 20:14:08,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:08,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:08,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:08,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:08,382 INFO L87 Difference]: Start difference. First operand 1580 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:14:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:08,597 INFO L93 Difference]: Finished difference Result 2976 states and 11811 transitions. [2020-02-10 20:14:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:08,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:08,606 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:14:08,606 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:14:08,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:14:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1574. [2020-02-10 20:14:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:14:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7077 transitions. [2020-02-10 20:14:08,678 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7077 transitions. Word has length 28 [2020-02-10 20:14:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:08,678 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7077 transitions. [2020-02-10 20:14:08,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7077 transitions. [2020-02-10 20:14:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:08,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:08,681 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:08,681 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:08,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash 823275178, now seen corresponding path program 125 times [2020-02-10 20:14:08,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:08,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551723241] [2020-02-10 20:14:08,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:09,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551723241] [2020-02-10 20:14:09,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:09,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:09,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487188114] [2020-02-10 20:14:09,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:09,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:09,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:09,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:09,224 INFO L87 Difference]: Start difference. First operand 1574 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:14:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:09,492 INFO L93 Difference]: Finished difference Result 2974 states and 11808 transitions. [2020-02-10 20:14:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:09,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:09,499 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:14:09,499 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:14:09,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:14:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1581. [2020-02-10 20:14:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:14:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7090 transitions. [2020-02-10 20:14:09,563 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7090 transitions. Word has length 28 [2020-02-10 20:14:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:09,563 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7090 transitions. [2020-02-10 20:14:09,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7090 transitions. [2020-02-10 20:14:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:09,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:09,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:09,566 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1567977676, now seen corresponding path program 126 times [2020-02-10 20:14:09,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:09,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232175172] [2020-02-10 20:14:09,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:10,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-02-10 20:14:10,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232175172] [2020-02-10 20:14:10,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:10,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:10,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094283437] [2020-02-10 20:14:10,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:10,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:10,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:10,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:10,125 INFO L87 Difference]: Start difference. First operand 1581 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:14:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:10,298 INFO L93 Difference]: Finished difference Result 2978 states and 11809 transitions. [2020-02-10 20:14:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:10,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:10,306 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:14:10,306 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:14:10,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:14:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1568. [2020-02-10 20:14:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:14:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7060 transitions. [2020-02-10 20:14:10,370 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7060 transitions. Word has length 28 [2020-02-10 20:14:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:10,370 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7060 transitions. [2020-02-10 20:14:10,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7060 transitions. [2020-02-10 20:14:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:10,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:10,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:10,372 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:10,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1871670534, now seen corresponding path program 127 times [2020-02-10 20:14:10,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:10,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124913622] [2020-02-10 20:14:10,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:10,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124913622] [2020-02-10 20:14:10,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:10,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:10,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255203724] [2020-02-10 20:14:10,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:10,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:10,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:10,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:10,924 INFO L87 Difference]: Start difference. First operand 1568 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:14:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:11,156 INFO L93 Difference]: Finished difference Result 2961 states and 11787 transitions. [2020-02-10 20:14:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:11,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:11,164 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:14:11,165 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:14:11,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:14:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1578. [2020-02-10 20:14:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:14:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7088 transitions. [2020-02-10 20:14:11,249 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7088 transitions. Word has length 28 [2020-02-10 20:14:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:11,250 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7088 transitions. [2020-02-10 20:14:11,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7088 transitions. [2020-02-10 20:14:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:11,252 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:11,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, 1, 1, 1] [2020-02-10 20:14:11,252 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:11,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1678594264, now seen corresponding path program 128 times [2020-02-10 20:14:11,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:11,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515917314] [2020-02-10 20:14:11,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:11,786 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:14:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:11,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515917314] [2020-02-10 20:14:11,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:11,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:11,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718473560] [2020-02-10 20:14:11,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:11,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:11,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:11,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:11,795 INFO L87 Difference]: Start difference. First operand 1578 states and 7088 transitions. Second operand 11 states. [2020-02-10 20:14:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:12,017 INFO L93 Difference]: Finished difference Result 2962 states and 11784 transitions. [2020-02-10 20:14:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:12,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:12,025 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:14:12,025 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:14:12,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:14:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1573. [2020-02-10 20:14:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:14:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7074 transitions. [2020-02-10 20:14:12,089 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7074 transitions. Word has length 28 [2020-02-10 20:14:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:12,089 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7074 transitions. [2020-02-10 20:14:12,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7074 transitions. [2020-02-10 20:14:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:12,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:12,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:12,092 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:12,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:12,092 INFO L82 PathProgramCache]: Analyzing trace with hash 798585154, now seen corresponding path program 129 times [2020-02-10 20:14:12,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:12,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880959082] [2020-02-10 20:14:12,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:12,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880959082] [2020-02-10 20:14:12,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:12,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:12,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908120682] [2020-02-10 20:14:12,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:12,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:12,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:12,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:12,615 INFO L87 Difference]: Start difference. First operand 1573 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:14:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:12,888 INFO L93 Difference]: Finished difference Result 2963 states and 11786 transitions. [2020-02-10 20:14:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:12,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:12,895 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:14:12,895 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:14:12,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:14:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1578. [2020-02-10 20:14:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:14:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7083 transitions. [2020-02-10 20:14:12,959 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7083 transitions. Word has length 28 [2020-02-10 20:14:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:12,959 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7083 transitions. [2020-02-10 20:14:12,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7083 transitions. [2020-02-10 20:14:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:12,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:12,962 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:12,962 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1262274648, now seen corresponding path program 130 times [2020-02-10 20:14:12,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:12,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830822411] [2020-02-10 20:14:12,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:13,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830822411] [2020-02-10 20:14:13,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:13,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:13,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442540155] [2020-02-10 20:14:13,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:13,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:13,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:13,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:13,480 INFO L87 Difference]: Start difference. First operand 1578 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:14:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:13,678 INFO L93 Difference]: Finished difference Result 2966 states and 11787 transitions. [2020-02-10 20:14:13,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:13,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:13,685 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:14:13,685 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:14:13,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:14:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1573. [2020-02-10 20:14:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:14:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7069 transitions. [2020-02-10 20:14:13,749 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7069 transitions. Word has length 28 [2020-02-10 20:14:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:13,750 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7069 transitions. [2020-02-10 20:14:13,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7069 transitions. [2020-02-10 20:14:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:13,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:13,752 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:13,752 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1140738686, now seen corresponding path program 131 times [2020-02-10 20:14:13,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:13,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161972584] [2020-02-10 20:14:13,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:14,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161972584] [2020-02-10 20:14:14,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:14,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:14,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838117448] [2020-02-10 20:14:14,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:14,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:14,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:14,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:14,275 INFO L87 Difference]: Start difference. First operand 1573 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:14:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:14,448 INFO L93 Difference]: Finished difference Result 2966 states and 11788 transitions. [2020-02-10 20:14:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:14,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:14,455 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:14:14,455 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:14:14,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:14:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1579. [2020-02-10 20:14:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:14:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7080 transitions. [2020-02-10 20:14:14,518 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7080 transitions. Word has length 28 [2020-02-10 20:14:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:14,518 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7080 transitions. [2020-02-10 20:14:14,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7080 transitions. [2020-02-10 20:14:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:14,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:14,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:14,521 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:14,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:14,521 INFO L82 PathProgramCache]: Analyzing trace with hash 348666310, now seen corresponding path program 132 times [2020-02-10 20:14:14,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:14,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892186669] [2020-02-10 20:14:14,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:15,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892186669] [2020-02-10 20:14:15,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:15,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:15,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084106041] [2020-02-10 20:14:15,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:15,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:15,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:15,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:15,042 INFO L87 Difference]: Start difference. First operand 1579 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:14:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:15,237 INFO L93 Difference]: Finished difference Result 2968 states and 11786 transitions. [2020-02-10 20:14:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:15,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:15,245 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:14:15,245 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:14:15,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:14:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1568. [2020-02-10 20:14:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:14:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7055 transitions. [2020-02-10 20:14:15,309 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7055 transitions. Word has length 28 [2020-02-10 20:14:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:15,309 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7055 transitions. [2020-02-10 20:14:15,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7055 transitions. [2020-02-10 20:14:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:15,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:15,312 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:15,312 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:15,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1882173638, now seen corresponding path program 133 times [2020-02-10 20:14:15,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:15,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480880461] [2020-02-10 20:14:15,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:15,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480880461] [2020-02-10 20:14:15,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:15,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:15,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109643206] [2020-02-10 20:14:15,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:15,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:15,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:15,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:15,844 INFO L87 Difference]: Start difference. First operand 1568 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:14:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:16,016 INFO L93 Difference]: Finished difference Result 2977 states and 11814 transitions. [2020-02-10 20:14:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:16,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:16,023 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:14:16,023 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:14:16,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:14:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1581. [2020-02-10 20:14:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:14:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7090 transitions. [2020-02-10 20:14:16,088 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7090 transitions. Word has length 28 [2020-02-10 20:14:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:16,088 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7090 transitions. [2020-02-10 20:14:16,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7090 transitions. [2020-02-10 20:14:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:16,091 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:16,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, 1, 1, 1] [2020-02-10 20:14:16,091 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash -923388662, now seen corresponding path program 134 times [2020-02-10 20:14:16,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:16,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856566191] [2020-02-10 20:14:16,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:16,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856566191] [2020-02-10 20:14:16,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:16,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:16,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499690863] [2020-02-10 20:14:16,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:16,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:16,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:16,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:16,627 INFO L87 Difference]: Start difference. First operand 1581 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:14:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:16,767 INFO L93 Difference]: Finished difference Result 2982 states and 11818 transitions. [2020-02-10 20:14:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:16,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:16,775 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:14:16,775 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:14:16,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:14:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1575. [2020-02-10 20:14:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:14:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7073 transitions. [2020-02-10 20:14:16,839 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7073 transitions. Word has length 28 [2020-02-10 20:14:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:16,839 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7073 transitions. [2020-02-10 20:14:16,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7073 transitions. [2020-02-10 20:14:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:16,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:16,842 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:16,842 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:16,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:16,842 INFO L82 PathProgramCache]: Analyzing trace with hash -801852700, now seen corresponding path program 135 times [2020-02-10 20:14:16,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:16,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174629538] [2020-02-10 20:14:16,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:17,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174629538] [2020-02-10 20:14:17,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:17,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:17,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967419775] [2020-02-10 20:14:17,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:17,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:17,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:17,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:17,407 INFO L87 Difference]: Start difference. First operand 1575 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:14:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:17,580 INFO L93 Difference]: Finished difference Result 2974 states and 11803 transitions. [2020-02-10 20:14:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:17,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:17,588 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:14:17,588 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:14:17,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:14:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1580. [2020-02-10 20:14:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:14:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7082 transitions. [2020-02-10 20:14:17,652 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7082 transitions. Word has length 28 [2020-02-10 20:14:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:17,652 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7082 transitions. [2020-02-10 20:14:17,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7082 transitions. [2020-02-10 20:14:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:17,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:17,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:17,655 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:17,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1432254794, now seen corresponding path program 136 times [2020-02-10 20:14:17,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:17,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358301423] [2020-02-10 20:14:17,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:18,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358301423] [2020-02-10 20:14:18,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:18,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:18,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391669824] [2020-02-10 20:14:18,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:18,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:18,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:18,184 INFO L87 Difference]: Start difference. First operand 1580 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:14:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:18,373 INFO L93 Difference]: Finished difference Result 2977 states and 11804 transitions. [2020-02-10 20:14:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:18,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:18,380 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:14:18,381 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:14:18,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:14:18,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1575. [2020-02-10 20:14:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:14:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7068 transitions. [2020-02-10 20:14:18,444 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7068 transitions. Word has length 28 [2020-02-10 20:14:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:18,445 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7068 transitions. [2020-02-10 20:14:18,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7068 transitions. [2020-02-10 20:14:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:18,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:18,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:18,447 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash -385533084, now seen corresponding path program 137 times [2020-02-10 20:14:18,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:18,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473559150] [2020-02-10 20:14:18,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:19,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473559150] [2020-02-10 20:14:19,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:19,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:19,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547540548] [2020-02-10 20:14:19,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:19,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:19,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:19,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:19,002 INFO L87 Difference]: Start difference. First operand 1575 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:14:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:19,142 INFO L93 Difference]: Finished difference Result 2989 states and 11828 transitions. [2020-02-10 20:14:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:19,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:19,150 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:14:19,151 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:14:19,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:14:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1585. [2020-02-10 20:14:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:14:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7085 transitions. [2020-02-10 20:14:19,214 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7085 transitions. Word has length 28 [2020-02-10 20:14:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:19,214 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7085 transitions. [2020-02-10 20:14:19,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7085 transitions. [2020-02-10 20:14:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:19,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:19,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:19,217 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash 359169414, now seen corresponding path program 138 times [2020-02-10 20:14:19,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:19,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547840030] [2020-02-10 20:14:19,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:19,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-02-10 20:14:19,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547840030] [2020-02-10 20:14:19,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:19,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:19,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286125563] [2020-02-10 20:14:19,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:19,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:19,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:19,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:19,780 INFO L87 Difference]: Start difference. First operand 1585 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:14:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:19,978 INFO L93 Difference]: Finished difference Result 2987 states and 11816 transitions. [2020-02-10 20:14:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:19,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:19,986 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 20:14:19,986 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:14:19,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:14:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1568. [2020-02-10 20:14:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:14:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7048 transitions. [2020-02-10 20:14:20,050 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7048 transitions. Word has length 28 [2020-02-10 20:14:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:20,050 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7048 transitions. [2020-02-10 20:14:20,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7048 transitions. [2020-02-10 20:14:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:20,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:20,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:20,053 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1657588056, now seen corresponding path program 139 times [2020-02-10 20:14:20,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:20,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537010130] [2020-02-10 20:14:20,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:20,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537010130] [2020-02-10 20:14:20,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:20,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:20,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260424451] [2020-02-10 20:14:20,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:20,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:20,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:20,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:20,583 INFO L87 Difference]: Start difference. First operand 1568 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:14:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:20,753 INFO L93 Difference]: Finished difference Result 2984 states and 11826 transitions. [2020-02-10 20:14:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:20,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:20,760 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:14:20,761 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:14:20,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:14:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1583. [2020-02-10 20:14:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:14:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7089 transitions. [2020-02-10 20:14:20,825 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7089 transitions. Word has length 28 [2020-02-10 20:14:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:20,825 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7089 transitions. [2020-02-10 20:14:20,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:20,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7089 transitions. [2020-02-10 20:14:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:20,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:20,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:20,829 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:20,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:20,829 INFO L82 PathProgramCache]: Analyzing trace with hash -912885558, now seen corresponding path program 140 times [2020-02-10 20:14:20,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:20,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013887609] [2020-02-10 20:14:20,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:21,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013887609] [2020-02-10 20:14:21,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:21,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:21,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004172384] [2020-02-10 20:14:21,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:21,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:21,373 INFO L87 Difference]: Start difference. First operand 1583 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:14:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:21,509 INFO L93 Difference]: Finished difference Result 2988 states and 11827 transitions. [2020-02-10 20:14:21,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:21,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:21,516 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:14:21,516 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:14:21,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:14:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1576. [2020-02-10 20:14:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:14:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7069 transitions. [2020-02-10 20:14:21,580 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7069 transitions. Word has length 28 [2020-02-10 20:14:21,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:21,580 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7069 transitions. [2020-02-10 20:14:21,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7069 transitions. [2020-02-10 20:14:21,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:21,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:21,583 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:21,583 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:21,583 INFO L82 PathProgramCache]: Analyzing trace with hash -46647098, now seen corresponding path program 141 times [2020-02-10 20:14:21,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:21,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261906174] [2020-02-10 20:14:21,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:22,102 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:14:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:22,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261906174] [2020-02-10 20:14:22,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:22,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:22,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556377832] [2020-02-10 20:14:22,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:22,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:22,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:22,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:22,110 INFO L87 Difference]: Start difference. First operand 1576 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:14:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:22,289 INFO L93 Difference]: Finished difference Result 2981 states and 11814 transitions. [2020-02-10 20:14:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:22,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:22,299 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:14:22,299 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:14:22,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:14:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1582. [2020-02-10 20:14:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:14:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7080 transitions. [2020-02-10 20:14:22,363 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7080 transitions. Word has length 28 [2020-02-10 20:14:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:22,363 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7080 transitions. [2020-02-10 20:14:22,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7080 transitions. [2020-02-10 20:14:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:22,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:22,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, 1, 1, 1] [2020-02-10 20:14:22,365 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1442757898, now seen corresponding path program 142 times [2020-02-10 20:14:22,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:22,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816230924] [2020-02-10 20:14:22,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:22,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816230924] [2020-02-10 20:14:22,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:22,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:22,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130273188] [2020-02-10 20:14:22,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:22,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:22,895 INFO L87 Difference]: Start difference. First operand 1582 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:14:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:23,102 INFO L93 Difference]: Finished difference Result 2983 states and 11812 transitions. [2020-02-10 20:14:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:23,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:23,110 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:14:23,110 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:14:23,110 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:14:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1576. [2020-02-10 20:14:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:14:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 20:14:23,174 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 20:14:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:23,174 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 20:14:23,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 20:14:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:23,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:23,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:23,176 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:23,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:23,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1985970938, now seen corresponding path program 143 times [2020-02-10 20:14:23,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:23,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89847367] [2020-02-10 20:14:23,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:23,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89847367] [2020-02-10 20:14:23,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:23,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:23,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528761085] [2020-02-10 20:14:23,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:23,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:23,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:23,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:23,734 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:14:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:23,880 INFO L93 Difference]: Finished difference Result 2993 states and 11831 transitions. [2020-02-10 20:14:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:23,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:23,888 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:14:23,888 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 20:14:23,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 20:14:23,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1586. [2020-02-10 20:14:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:14:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7080 transitions. [2020-02-10 20:14:23,972 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7080 transitions. Word has length 28 [2020-02-10 20:14:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:23,972 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7080 transitions. [2020-02-10 20:14:23,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7080 transitions. [2020-02-10 20:14:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:23,975 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:23,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:23,975 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1241268440, now seen corresponding path program 144 times [2020-02-10 20:14:23,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:23,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471471881] [2020-02-10 20:14:23,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:24,510 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:14:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:24,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471471881] [2020-02-10 20:14:24,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:24,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:24,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768130540] [2020-02-10 20:14:24,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:24,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:24,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:24,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:24,518 INFO L87 Difference]: Start difference. First operand 1586 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:14:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:24,702 INFO L93 Difference]: Finished difference Result 2991 states and 11819 transitions. [2020-02-10 20:14:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:24,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:24,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:24,710 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:14:24,710 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:14:24,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:14:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1561. [2020-02-10 20:14:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:14:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7029 transitions. [2020-02-10 20:14:24,774 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7029 transitions. Word has length 28 [2020-02-10 20:14:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:24,774 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7029 transitions. [2020-02-10 20:14:24,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7029 transitions. [2020-02-10 20:14:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:24,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:24,776 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:24,776 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1398945230, now seen corresponding path program 145 times [2020-02-10 20:14:24,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:24,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678912211] [2020-02-10 20:14:24,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:25,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678912211] [2020-02-10 20:14:25,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:25,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:25,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332255358] [2020-02-10 20:14:25,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:25,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:25,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:25,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:25,320 INFO L87 Difference]: Start difference. First operand 1561 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:14:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:25,503 INFO L93 Difference]: Finished difference Result 2946 states and 11739 transitions. [2020-02-10 20:14:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:25,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:25,510 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:14:25,511 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 20:14:25,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 20:14:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1577. [2020-02-10 20:14:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:14:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7083 transitions. [2020-02-10 20:14:25,575 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7083 transitions. Word has length 28 [2020-02-10 20:14:25,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:25,575 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7083 transitions. [2020-02-10 20:14:25,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7083 transitions. [2020-02-10 20:14:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:25,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:25,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:25,578 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:25,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:25,578 INFO L82 PathProgramCache]: Analyzing trace with hash -654242732, now seen corresponding path program 146 times [2020-02-10 20:14:25,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:25,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327417509] [2020-02-10 20:14:25,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:26,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327417509] [2020-02-10 20:14:26,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:26,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:26,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843149061] [2020-02-10 20:14:26,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:26,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:26,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:26,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:26,108 INFO L87 Difference]: Start difference. First operand 1577 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:14:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:26,288 INFO L93 Difference]: Finished difference Result 2947 states and 11736 transitions. [2020-02-10 20:14:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:26,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:26,295 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:14:26,295 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:14:26,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:14:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1572. [2020-02-10 20:14:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:14:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7069 transitions. [2020-02-10 20:14:26,360 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7069 transitions. Word has length 28 [2020-02-10 20:14:26,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:26,360 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7069 transitions. [2020-02-10 20:14:26,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7069 transitions. [2020-02-10 20:14:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:26,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:26,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:26,363 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:26,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:26,363 INFO L82 PathProgramCache]: Analyzing trace with hash 211995728, now seen corresponding path program 147 times [2020-02-10 20:14:26,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:26,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802808856] [2020-02-10 20:14:26,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:26,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802808856] [2020-02-10 20:14:26,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:26,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:26,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905854307] [2020-02-10 20:14:26,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:26,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:26,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:26,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:26,893 INFO L87 Difference]: Start difference. First operand 1572 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:14:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:27,102 INFO L93 Difference]: Finished difference Result 2951 states and 11743 transitions. [2020-02-10 20:14:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:27,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:27,110 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:14:27,110 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:14:27,110 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:27,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:14:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1578. [2020-02-10 20:14:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:14:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7080 transitions. [2020-02-10 20:14:27,175 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7080 transitions. Word has length 28 [2020-02-10 20:14:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:27,175 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7080 transitions. [2020-02-10 20:14:27,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7080 transitions. [2020-02-10 20:14:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:27,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:27,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:27,178 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:27,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1701400724, now seen corresponding path program 148 times [2020-02-10 20:14:27,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:27,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874497125] [2020-02-10 20:14:27,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:27,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874497125] [2020-02-10 20:14:27,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:27,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:27,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254159615] [2020-02-10 20:14:27,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:27,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:27,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:27,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:27,708 INFO L87 Difference]: Start difference. First operand 1578 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:14:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:27,857 INFO L93 Difference]: Finished difference Result 2956 states and 11747 transitions. [2020-02-10 20:14:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:27,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:27,865 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:14:27,865 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:14:27,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:14:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1572. [2020-02-10 20:14:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:14:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7063 transitions. [2020-02-10 20:14:27,929 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7063 transitions. Word has length 28 [2020-02-10 20:14:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:27,929 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7063 transitions. [2020-02-10 20:14:27,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7063 transitions. [2020-02-10 20:14:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:27,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:27,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:27,931 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:27,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1727328112, now seen corresponding path program 149 times [2020-02-10 20:14:27,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:27,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89920051] [2020-02-10 20:14:27,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:28,364 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2020-02-10 20:14:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:28,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89920051] [2020-02-10 20:14:28,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:28,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:28,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372287099] [2020-02-10 20:14:28,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:28,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:28,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:28,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:28,484 INFO L87 Difference]: Start difference. First operand 1572 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:14:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:28,659 INFO L93 Difference]: Finished difference Result 2954 states and 11744 transitions. [2020-02-10 20:14:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:28,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:28,667 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:14:28,667 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:14:28,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:14:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1579. [2020-02-10 20:14:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:14:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7076 transitions. [2020-02-10 20:14:28,731 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7076 transitions. Word has length 28 [2020-02-10 20:14:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:28,731 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7076 transitions. [2020-02-10 20:14:28,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7076 transitions. [2020-02-10 20:14:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:28,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:28,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:28,734 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:28,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:28,734 INFO L82 PathProgramCache]: Analyzing trace with hash -982625614, now seen corresponding path program 150 times [2020-02-10 20:14:28,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:28,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297357093] [2020-02-10 20:14:28,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:29,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297357093] [2020-02-10 20:14:29,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:29,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:29,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401672165] [2020-02-10 20:14:29,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:29,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:29,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:29,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:29,273 INFO L87 Difference]: Start difference. First operand 1579 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:14:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:29,420 INFO L93 Difference]: Finished difference Result 2958 states and 11745 transitions. [2020-02-10 20:14:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:29,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:29,428 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:14:29,428 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:14:29,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:14:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1566. [2020-02-10 20:14:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:14:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7047 transitions. [2020-02-10 20:14:29,492 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7047 transitions. Word has length 28 [2020-02-10 20:14:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:29,492 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7047 transitions. [2020-02-10 20:14:29,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7047 transitions. [2020-02-10 20:14:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:29,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:29,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, 1, 1, 1] [2020-02-10 20:14:29,495 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:29,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1606068116, now seen corresponding path program 151 times [2020-02-10 20:14:29,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:29,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51975746] [2020-02-10 20:14:29,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:30,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51975746] [2020-02-10 20:14:30,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:30,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:30,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412492357] [2020-02-10 20:14:30,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:30,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:30,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:30,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:30,022 INFO L87 Difference]: Start difference. First operand 1566 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:14:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:30,194 INFO L93 Difference]: Finished difference Result 2933 states and 11703 transitions. [2020-02-10 20:14:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:30,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:30,202 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:14:30,202 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:14:30,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:14:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1575. [2020-02-10 20:14:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:14:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 20:14:30,265 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 20:14:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:30,266 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 20:14:30,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 20:14:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:30,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:30,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:30,268 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash -861365618, now seen corresponding path program 152 times [2020-02-10 20:14:30,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:30,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549618031] [2020-02-10 20:14:30,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:30,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549618031] [2020-02-10 20:14:30,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:30,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:30,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637808896] [2020-02-10 20:14:30,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:30,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:30,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:30,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:30,807 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:14:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:30,991 INFO L93 Difference]: Finished difference Result 2934 states and 11700 transitions. [2020-02-10 20:14:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:30,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:30,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:30,999 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:14:30,999 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:14:30,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:14:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1570. [2020-02-10 20:14:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:14:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7058 transitions. [2020-02-10 20:14:31,063 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7058 transitions. Word has length 28 [2020-02-10 20:14:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,063 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7058 transitions. [2020-02-10 20:14:31,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7058 transitions. [2020-02-10 20:14:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:31,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:31,066 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2141297918, now seen corresponding path program 153 times [2020-02-10 20:14:31,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638280569] [2020-02-10 20:14:31,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:31,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638280569] [2020-02-10 20:14:31,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:31,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:31,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983040150] [2020-02-10 20:14:31,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:31,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:31,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:31,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:31,635 INFO L87 Difference]: Start difference. First operand 1570 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:14:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:31,826 INFO L93 Difference]: Finished difference Result 2930 states and 11692 transitions. [2020-02-10 20:14:31,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:31,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:31,834 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:14:31,834 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 20:14:31,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:31,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 20:14:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1574. [2020-02-10 20:14:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:14:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7065 transitions. [2020-02-10 20:14:31,898 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7065 transitions. Word has length 28 [2020-02-10 20:14:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,898 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7065 transitions. [2020-02-10 20:14:31,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7065 transitions. [2020-02-10 20:14:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:31,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:31,900 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1968050226, now seen corresponding path program 154 times [2020-02-10 20:14:31,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430595404] [2020-02-10 20:14:31,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:32,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430595404] [2020-02-10 20:14:32,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:32,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:32,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29739253] [2020-02-10 20:14:32,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:32,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:32,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:32,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:32,427 INFO L87 Difference]: Start difference. First operand 1574 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:14:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:32,612 INFO L93 Difference]: Finished difference Result 2929 states and 11686 transitions. [2020-02-10 20:14:32,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:32,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:32,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:32,620 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:14:32,620 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:14:32,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:14:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1570. [2020-02-10 20:14:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:14:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7054 transitions. [2020-02-10 20:14:32,686 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7054 transitions. Word has length 28 [2020-02-10 20:14:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:32,686 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7054 transitions. [2020-02-10 20:14:32,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:32,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7054 transitions. [2020-02-10 20:14:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:32,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:32,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:32,688 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 214345538, now seen corresponding path program 155 times [2020-02-10 20:14:32,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:32,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611096482] [2020-02-10 20:14:32,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:33,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611096482] [2020-02-10 20:14:33,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:33,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:33,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405773773] [2020-02-10 20:14:33,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:33,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:33,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:33,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:33,220 INFO L87 Difference]: Start difference. First operand 1570 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:14:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:33,422 INFO L93 Difference]: Finished difference Result 2932 states and 11692 transitions. [2020-02-10 20:14:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:33,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:33,431 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:14:33,431 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:14:33,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:14:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1574. [2020-02-10 20:14:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:14:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7061 transitions. [2020-02-10 20:14:33,494 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7061 transitions. Word has length 28 [2020-02-10 20:14:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:33,494 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7061 transitions. [2020-02-10 20:14:33,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7061 transitions. [2020-02-10 20:14:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:33,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:33,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:33,497 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash -357109268, now seen corresponding path program 156 times [2020-02-10 20:14:33,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:33,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591073983] [2020-02-10 20:14:33,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:34,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591073983] [2020-02-10 20:14:34,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:34,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:34,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304277049] [2020-02-10 20:14:34,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:34,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:34,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:34,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:34,033 INFO L87 Difference]: Start difference. First operand 1574 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:14:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,217 INFO L93 Difference]: Finished difference Result 2930 states and 11684 transitions. [2020-02-10 20:14:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:34,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,225 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:14:34,225 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:14:34,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:14:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1566. [2020-02-10 20:14:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:14:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7043 transitions. [2020-02-10 20:14:34,289 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7043 transitions. Word has length 28 [2020-02-10 20:14:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:34,289 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7043 transitions. [2020-02-10 20:14:34,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7043 transitions. [2020-02-10 20:14:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:34,292 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:34,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, 1, 1, 1] [2020-02-10 20:14:34,292 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:34,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1595565012, now seen corresponding path program 157 times [2020-02-10 20:14:34,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:34,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137535399] [2020-02-10 20:14:34,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:34,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137535399] [2020-02-10 20:14:34,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:34,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:34,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847727822] [2020-02-10 20:14:34,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:34,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:34,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:34,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:34,800 INFO L87 Difference]: Start difference. First operand 1566 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:14:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,972 INFO L93 Difference]: Finished difference Result 2945 states and 11722 transitions. [2020-02-10 20:14:34,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:34,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,979 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:14:34,979 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:14:34,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:14:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1577. [2020-02-10 20:14:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:14:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7072 transitions. [2020-02-10 20:14:35,043 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7072 transitions. Word has length 28 [2020-02-10 20:14:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:35,044 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7072 transitions. [2020-02-10 20:14:35,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7072 transitions. [2020-02-10 20:14:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:35,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:35,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:35,046 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:35,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:35,046 INFO L82 PathProgramCache]: Analyzing trace with hash -106160016, now seen corresponding path program 158 times [2020-02-10 20:14:35,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:35,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771602897] [2020-02-10 20:14:35,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:35,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-02-10 20:14:35,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771602897] [2020-02-10 20:14:35,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:35,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:35,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88334142] [2020-02-10 20:14:35,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:35,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:35,574 INFO L87 Difference]: Start difference. First operand 1577 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:14:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:35,715 INFO L93 Difference]: Finished difference Result 2950 states and 11726 transitions. [2020-02-10 20:14:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:35,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:35,723 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:14:35,723 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:14:35,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:14:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1571. [2020-02-10 20:14:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:14:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7056 transitions. [2020-02-10 20:14:35,788 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7056 transitions. Word has length 28 [2020-02-10 20:14:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:35,788 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7056 transitions. [2020-02-10 20:14:35,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7056 transitions. [2020-02-10 20:14:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:35,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:35,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:35,792 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash 553231524, now seen corresponding path program 159 times [2020-02-10 20:14:35,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:35,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629411243] [2020-02-10 20:14:35,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:36,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629411243] [2020-02-10 20:14:36,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:36,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:36,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337324535] [2020-02-10 20:14:36,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:36,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:36,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:36,339 INFO L87 Difference]: Start difference. First operand 1571 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:14:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:36,565 INFO L93 Difference]: Finished difference Result 2937 states and 11701 transitions. [2020-02-10 20:14:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:36,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:36,573 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:14:36,573 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 20:14:36,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 20:14:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1575. [2020-02-10 20:14:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:14:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7063 transitions. [2020-02-10 20:14:36,636 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7063 transitions. Word has length 28 [2020-02-10 20:14:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:36,636 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7063 transitions. [2020-02-10 20:14:36,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7063 transitions. [2020-02-10 20:14:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:36,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:36,639 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:36,639 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:36,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:36,639 INFO L82 PathProgramCache]: Analyzing trace with hash 726479216, now seen corresponding path program 160 times [2020-02-10 20:14:36,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:36,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043309148] [2020-02-10 20:14:36,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:37,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043309148] [2020-02-10 20:14:37,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:37,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:37,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303104728] [2020-02-10 20:14:37,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:37,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:37,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:37,167 INFO L87 Difference]: Start difference. First operand 1575 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:14:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:37,374 INFO L93 Difference]: Finished difference Result 2936 states and 11695 transitions. [2020-02-10 20:14:37,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:37,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:37,381 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 20:14:37,381 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:14:37,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:14:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1571. [2020-02-10 20:14:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:14:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7052 transitions. [2020-02-10 20:14:37,445 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7052 transitions. Word has length 28 [2020-02-10 20:14:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:37,445 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7052 transitions. [2020-02-10 20:14:37,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7052 transitions. [2020-02-10 20:14:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:37,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:37,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:37,447 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:37,448 INFO L82 PathProgramCache]: Analyzing trace with hash 969551140, now seen corresponding path program 161 times [2020-02-10 20:14:37,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:37,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611996245] [2020-02-10 20:14:37,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:37,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611996245] [2020-02-10 20:14:37,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:37,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:37,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464331922] [2020-02-10 20:14:37,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:37,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:37,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:37,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:37,965 INFO L87 Difference]: Start difference. First operand 1571 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:14:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:38,126 INFO L93 Difference]: Finished difference Result 2948 states and 11717 transitions. [2020-02-10 20:14:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:38,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:38,133 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:14:38,134 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:14:38,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:38,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:14:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1576. [2020-02-10 20:14:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:14:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7060 transitions. [2020-02-10 20:14:38,197 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7060 transitions. Word has length 28 [2020-02-10 20:14:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:38,197 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7060 transitions. [2020-02-10 20:14:38,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7060 transitions. [2020-02-10 20:14:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:38,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14: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, 1, 1, 1] [2020-02-10 20:14:38,200 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash -346606164, now seen corresponding path program 162 times [2020-02-10 20:14:38,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:38,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626651545] [2020-02-10 20:14:38,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:38,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626651545] [2020-02-10 20:14:38,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:38,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:38,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254024261] [2020-02-10 20:14:38,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:38,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:38,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:38,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:38,711 INFO L87 Difference]: Start difference. First operand 1576 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:14:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:38,939 INFO L93 Difference]: Finished difference Result 2942 states and 11701 transitions. [2020-02-10 20:14:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:38,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:38,946 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:14:38,946 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:14:38,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:14:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1566. [2020-02-10 20:14:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:14:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7038 transitions. [2020-02-10 20:14:39,009 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7038 transitions. Word has length 28 [2020-02-10 20:14:39,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,010 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7038 transitions. [2020-02-10 20:14:39,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:39,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7038 transitions. [2020-02-10 20:14:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:39,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:39,012 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,012 INFO L82 PathProgramCache]: Analyzing trace with hash -840359410, now seen corresponding path program 163 times [2020-02-10 20:14:39,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497405893] [2020-02-10 20:14:39,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:39,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497405893] [2020-02-10 20:14:39,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:39,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:39,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150250618] [2020-02-10 20:14:39,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:39,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:39,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:39,536 INFO L87 Difference]: Start difference. First operand 1566 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:14:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:39,715 INFO L93 Difference]: Finished difference Result 2950 states and 11729 transitions. [2020-02-10 20:14:39,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:39,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:39,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:39,723 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:14:39,723 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:14:39,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:14:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1578. [2020-02-10 20:14:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:14:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7069 transitions. [2020-02-10 20:14:39,787 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7069 transitions. Word has length 28 [2020-02-10 20:14:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,787 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7069 transitions. [2020-02-10 20:14:39,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7069 transitions. [2020-02-10 20:14:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:39,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:39,790 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -95656912, now seen corresponding path program 164 times [2020-02-10 20:14:39,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960401613] [2020-02-10 20:14:39,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:40,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960401613] [2020-02-10 20:14:40,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:40,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:40,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131393381] [2020-02-10 20:14:40,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:40,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:40,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:40,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:40,330 INFO L87 Difference]: Start difference. First operand 1578 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:14:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:40,519 INFO L93 Difference]: Finished difference Result 2954 states and 11730 transitions. [2020-02-10 20:14:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:40,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:40,526 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:14:40,526 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:14:40,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:14:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1571. [2020-02-10 20:14:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:14:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7051 transitions. [2020-02-10 20:14:40,590 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7051 transitions. Word has length 28 [2020-02-10 20:14:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:40,590 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7051 transitions. [2020-02-10 20:14:40,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7051 transitions. [2020-02-10 20:14:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:40,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:40,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:40,592 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:40,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1308437126, now seen corresponding path program 165 times [2020-02-10 20:14:40,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:40,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409272885] [2020-02-10 20:14:40,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:41,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409272885] [2020-02-10 20:14:41,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:41,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141590397] [2020-02-10 20:14:41,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:41,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:41,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:41,110 INFO L87 Difference]: Start difference. First operand 1571 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:14:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:41,299 INFO L93 Difference]: Finished difference Result 2941 states and 11705 transitions. [2020-02-10 20:14:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:41,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:41,307 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:14:41,307 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:14:41,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:14:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1575. [2020-02-10 20:14:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:14:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7058 transitions. [2020-02-10 20:14:41,371 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7058 transitions. Word has length 28 [2020-02-10 20:14:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:41,371 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7058 transitions. [2020-02-10 20:14:41,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7058 transitions. [2020-02-10 20:14:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:41,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:41,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:41,374 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:41,374 INFO L82 PathProgramCache]: Analyzing trace with hash 736982320, now seen corresponding path program 166 times [2020-02-10 20:14:41,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:41,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431418398] [2020-02-10 20:14:41,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,800 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:14:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:41,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431418398] [2020-02-10 20:14:41,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:41,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012622131] [2020-02-10 20:14:41,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:41,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:41,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:41,920 INFO L87 Difference]: Start difference. First operand 1575 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:14:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:42,125 INFO L93 Difference]: Finished difference Result 2939 states and 11697 transitions. [2020-02-10 20:14:42,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:42,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:42,133 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:14:42,133 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:14:42,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:14:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1571. [2020-02-10 20:14:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:14:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7047 transitions. [2020-02-10 20:14:42,197 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7047 transitions. Word has length 28 [2020-02-10 20:14:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:42,197 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7047 transitions. [2020-02-10 20:14:42,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7047 transitions. [2020-02-10 20:14:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:42,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:42,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:42,199 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash -630886714, now seen corresponding path program 167 times [2020-02-10 20:14:42,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:42,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624101279] [2020-02-10 20:14:42,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:42,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624101279] [2020-02-10 20:14:42,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:42,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:42,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450269989] [2020-02-10 20:14:42,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:42,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:42,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:42,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:42,721 INFO L87 Difference]: Start difference. First operand 1571 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:14:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:42,971 INFO L93 Difference]: Finished difference Result 2950 states and 11717 transitions. [2020-02-10 20:14:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:42,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:42,979 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:14:42,979 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:14:42,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:14:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:14:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:14:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7055 transitions. [2020-02-10 20:14:43,043 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7055 transitions. Word has length 28 [2020-02-10 20:14:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,043 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7055 transitions. [2020-02-10 20:14:43,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7055 transitions. [2020-02-10 20:14:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:43,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14: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, 1, 1, 1] [2020-02-10 20:14:43,045 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1947044018, now seen corresponding path program 168 times [2020-02-10 20:14:43,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604997359] [2020-02-10 20:14:43,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:43,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604997359] [2020-02-10 20:14:43,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:43,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:43,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694994068] [2020-02-10 20:14:43,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:43,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:43,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:43,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:43,597 INFO L87 Difference]: Start difference. First operand 1576 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:14:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:43,791 INFO L93 Difference]: Finished difference Result 2944 states and 11701 transitions. [2020-02-10 20:14:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:43,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:43,799 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:14:43,799 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 20:14:43,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:43,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 20:14:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1561. [2020-02-10 20:14:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:14:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7024 transitions. [2020-02-10 20:14:43,862 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7024 transitions. Word has length 28 [2020-02-10 20:14:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,862 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7024 transitions. [2020-02-10 20:14:43,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7024 transitions. [2020-02-10 20:14:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:43,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:43,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:43,865 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash -254171636, now seen corresponding path program 169 times [2020-02-10 20:14:43,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405250715] [2020-02-10 20:14:43,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:44,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405250715] [2020-02-10 20:14:44,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:44,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:44,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986505005] [2020-02-10 20:14:44,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:44,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:44,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:44,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:44,381 INFO L87 Difference]: Start difference. First operand 1561 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:14:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:44,590 INFO L93 Difference]: Finished difference Result 2932 states and 11702 transitions. [2020-02-10 20:14:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:44,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:44,597 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:14:44,597 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 20:14:44,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 20:14:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1575. [2020-02-10 20:14:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:14:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 20:14:44,661 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 20:14:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:44,661 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 20:14:44,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 20:14:44,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:44,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:44,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:44,663 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:44,664 INFO L82 PathProgramCache]: Analyzing trace with hash 490530862, now seen corresponding path program 170 times [2020-02-10 20:14:44,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:44,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190202961] [2020-02-10 20:14:44,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:45,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190202961] [2020-02-10 20:14:45,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:45,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:45,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070722892] [2020-02-10 20:14:45,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:45,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:45,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:45,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:45,185 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:14:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:45,426 INFO L93 Difference]: Finished difference Result 2933 states and 11699 transitions. [2020-02-10 20:14:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:45,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:45,433 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:14:45,433 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:14:45,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:14:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1570. [2020-02-10 20:14:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:14:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7057 transitions. [2020-02-10 20:14:45,497 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7057 transitions. Word has length 28 [2020-02-10 20:14:45,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:45,497 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7057 transitions. [2020-02-10 20:14:45,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:45,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7057 transitions. [2020-02-10 20:14:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:45,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:45,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:45,500 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1327257016, now seen corresponding path program 171 times [2020-02-10 20:14:45,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:45,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694696065] [2020-02-10 20:14:45,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14: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-02-10 20:14:46,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694696065] [2020-02-10 20:14:46,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:46,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:46,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277138128] [2020-02-10 20:14:46,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:46,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:46,034 INFO L87 Difference]: Start difference. First operand 1570 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:14:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:46,227 INFO L93 Difference]: Finished difference Result 2934 states and 11701 transitions. [2020-02-10 20:14:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:46,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:46,234 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:14:46,234 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 20:14:46,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 20:14:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1575. [2020-02-10 20:14:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:14:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7066 transitions. [2020-02-10 20:14:46,298 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7066 transitions. Word has length 28 [2020-02-10 20:14:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:46,298 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7066 transitions. [2020-02-10 20:14:46,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7066 transitions. [2020-02-10 20:14:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:46,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:46,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, 1, 1, 1] [2020-02-10 20:14:46,300 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:46,301 INFO L82 PathProgramCache]: Analyzing trace with hash 906850478, now seen corresponding path program 172 times [2020-02-10 20:14:46,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:46,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672580750] [2020-02-10 20:14:46,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:46,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672580750] [2020-02-10 20:14:46,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:46,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:46,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452342293] [2020-02-10 20:14:46,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:46,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:46,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:46,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:46,844 INFO L87 Difference]: Start difference. First operand 1575 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:14:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:47,040 INFO L93 Difference]: Finished difference Result 2937 states and 11702 transitions. [2020-02-10 20:14:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:47,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:47,048 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:14:47,048 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:14:47,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:14:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1570. [2020-02-10 20:14:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:14:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 20:14:47,112 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 20:14:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:47,112 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 20:14:47,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 20:14:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:47,115 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:47,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:47,115 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:47,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1028386440, now seen corresponding path program 173 times [2020-02-10 20:14:47,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:47,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418831678] [2020-02-10 20:14:47,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:47,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418831678] [2020-02-10 20:14:47,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:47,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:47,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425441331] [2020-02-10 20:14:47,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:47,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:47,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:47,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:47,635 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:14:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:47,846 INFO L93 Difference]: Finished difference Result 2937 states and 11703 transitions. [2020-02-10 20:14:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:47,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:47,853 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:14:47,854 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:14:47,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:14:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1576. [2020-02-10 20:14:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:14:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 20:14:47,918 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 20:14:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:47,918 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 20:14:47,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 20:14:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:47,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:47,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:47,920 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:47,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1777175860, now seen corresponding path program 174 times [2020-02-10 20:14:47,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:47,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678332567] [2020-02-10 20:14:47,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:48,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678332567] [2020-02-10 20:14:48,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:48,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:48,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968346436] [2020-02-10 20:14:48,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:48,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:48,465 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:14:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:48,639 INFO L93 Difference]: Finished difference Result 2939 states and 11701 transitions. [2020-02-10 20:14:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:48,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:48,646 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:14:48,646 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:14:48,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:14:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1565. [2020-02-10 20:14:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:14:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7039 transitions. [2020-02-10 20:14:48,710 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7039 transitions. Word has length 28 [2020-02-10 20:14:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:48,710 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7039 transitions. [2020-02-10 20:14:48,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7039 transitions. [2020-02-10 20:14:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:48,713 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:48,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, 1, 1, 1] [2020-02-10 20:14:48,713 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:48,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:48,713 INFO L82 PathProgramCache]: Analyzing trace with hash -760517902, now seen corresponding path program 175 times [2020-02-10 20:14:48,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:48,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890736185] [2020-02-10 20:14:48,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:49,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890736185] [2020-02-10 20:14:49,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:49,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:49,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997367839] [2020-02-10 20:14:49,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:49,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:49,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:49,243 INFO L87 Difference]: Start difference. First operand 1565 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:14:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:49,425 INFO L93 Difference]: Finished difference Result 2924 states and 11677 transitions. [2020-02-10 20:14:49,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:49,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:49,433 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:14:49,433 INFO L226 Difference]: Without dead ends: 2909 [2020-02-10 20:14:49,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2020-02-10 20:14:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1574. [2020-02-10 20:14:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:14:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7063 transitions. [2020-02-10 20:14:49,499 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7063 transitions. Word has length 28 [2020-02-10 20:14:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:49,499 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7063 transitions. [2020-02-10 20:14:49,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7063 transitions. [2020-02-10 20:14:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:49,501 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:49,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:49,502 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash -15815404, now seen corresponding path program 176 times [2020-02-10 20:14:49,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:49,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837389804] [2020-02-10 20:14:49,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:50,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837389804] [2020-02-10 20:14:50,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:50,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:50,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259531889] [2020-02-10 20:14:50,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:50,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:50,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:50,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:50,039 INFO L87 Difference]: Start difference. First operand 1574 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:14:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:50,227 INFO L93 Difference]: Finished difference Result 2925 states and 11674 transitions. [2020-02-10 20:14:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:50,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:50,235 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:14:50,235 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:14:50,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:14:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1569. [2020-02-10 20:14:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:14:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7050 transitions. [2020-02-10 20:14:50,300 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7050 transitions. Word has length 28 [2020-02-10 20:14:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:50,300 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7050 transitions. [2020-02-10 20:14:50,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7050 transitions. [2020-02-10 20:14:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:50,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:50,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:50,303 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1295747704, now seen corresponding path program 177 times [2020-02-10 20:14:50,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:50,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001328199] [2020-02-10 20:14:50,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:50,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001328199] [2020-02-10 20:14:50,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:50,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:50,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507240692] [2020-02-10 20:14:50,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:50,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:50,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:50,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:50,832 INFO L87 Difference]: Start difference. First operand 1569 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:14:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:51,051 INFO L93 Difference]: Finished difference Result 2921 states and 11666 transitions. [2020-02-10 20:14:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:51,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:51,057 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:14:51,057 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:14:51,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:14:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1573. [2020-02-10 20:14:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:14:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 20:14:51,121 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 20:14:51,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:51,121 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 20:14:51,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 20:14:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:51,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:51,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:51,124 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:51,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1122500012, now seen corresponding path program 178 times [2020-02-10 20:14:51,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:51,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765898558] [2020-02-10 20:14:51,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:51,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765898558] [2020-02-10 20:14:51,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:51,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:51,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366481321] [2020-02-10 20:14:51,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:51,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:51,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:51,656 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:14:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:51,852 INFO L93 Difference]: Finished difference Result 2920 states and 11660 transitions. [2020-02-10 20:14:51,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:51,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:51,860 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:14:51,860 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 20:14:51,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 20:14:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1569. [2020-02-10 20:14:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:14:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7046 transitions. [2020-02-10 20:14:51,925 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7046 transitions. Word has length 28 [2020-02-10 20:14:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:51,925 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7046 transitions. [2020-02-10 20:14:51,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7046 transitions. [2020-02-10 20:14:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:51,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:51,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:51,927 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:51,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1059895752, now seen corresponding path program 179 times [2020-02-10 20:14:51,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:51,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101951375] [2020-02-10 20:14:51,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:52,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101951375] [2020-02-10 20:14:52,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:52,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:52,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391591620] [2020-02-10 20:14:52,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:52,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:52,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:52,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:52,457 INFO L87 Difference]: Start difference. First operand 1569 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:14:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:52,661 INFO L93 Difference]: Finished difference Result 2923 states and 11666 transitions. [2020-02-10 20:14:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:52,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:52,668 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:14:52,668 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:14:52,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:14:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1573. [2020-02-10 20:14:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:14:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7053 transitions. [2020-02-10 20:14:52,733 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7053 transitions. Word has length 28 [2020-02-10 20:14:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:52,733 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7053 transitions. [2020-02-10 20:14:52,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7053 transitions. [2020-02-10 20:14:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:52,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:52,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:52,736 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash 488440946, now seen corresponding path program 180 times [2020-02-10 20:14:52,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:52,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263033827] [2020-02-10 20:14:52,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:53,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263033827] [2020-02-10 20:14:53,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:53,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:53,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032513398] [2020-02-10 20:14:53,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:53,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:53,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:53,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:53,274 INFO L87 Difference]: Start difference. First operand 1573 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:14:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:53,458 INFO L93 Difference]: Finished difference Result 2921 states and 11658 transitions. [2020-02-10 20:14:53,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:53,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:53,466 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:14:53,466 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:14:53,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:14:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1565. [2020-02-10 20:14:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:14:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7035 transitions. [2020-02-10 20:14:53,531 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7035 transitions. Word has length 28 [2020-02-10 20:14:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:53,531 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7035 transitions. [2020-02-10 20:14:53,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7035 transitions. [2020-02-10 20:14:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:53,535 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:53,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:53,535 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:53,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:53,535 INFO L82 PathProgramCache]: Analyzing trace with hash -739511694, now seen corresponding path program 181 times [2020-02-10 20:14:53,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:53,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179852619] [2020-02-10 20:14:53,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:54,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179852619] [2020-02-10 20:14:54,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:54,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117293920] [2020-02-10 20:14:54,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:54,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:54,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:54,050 INFO L87 Difference]: Start difference. First operand 1565 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:14:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:54,232 INFO L93 Difference]: Finished difference Result 2928 states and 11681 transitions. [2020-02-10 20:14:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:54,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:54,241 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 20:14:54,241 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:14:54,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:14:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1574. [2020-02-10 20:14:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:14:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7059 transitions. [2020-02-10 20:14:54,312 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7059 transitions. Word has length 28 [2020-02-10 20:14:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:54,312 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7059 transitions. [2020-02-10 20:14:54,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7059 transitions. [2020-02-10 20:14:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:54,314 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:54,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:54,315 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:54,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1494595800, now seen corresponding path program 182 times [2020-02-10 20:14:54,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:54,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494439788] [2020-02-10 20:14:54,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:54,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494439788] [2020-02-10 20:14:54,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:54,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589923099] [2020-02-10 20:14:54,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:54,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:54,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:54,833 INFO L87 Difference]: Start difference. First operand 1574 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:14:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:55,050 INFO L93 Difference]: Finished difference Result 2931 states and 11682 transitions. [2020-02-10 20:14:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:55,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:55,058 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 20:14:55,058 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:14:55,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:14:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1569. [2020-02-10 20:14:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:14:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7046 transitions. [2020-02-10 20:14:55,123 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7046 transitions. Word has length 28 [2020-02-10 20:14:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:55,123 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7046 transitions. [2020-02-10 20:14:55,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7046 transitions. [2020-02-10 20:14:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:55,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:55,125 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:55,125 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:55,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:55,126 INFO L82 PathProgramCache]: Analyzing trace with hash -201656116, now seen corresponding path program 183 times [2020-02-10 20:14:55,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:55,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499789798] [2020-02-10 20:14:55,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:55,668 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:14:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:55,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499789798] [2020-02-10 20:14:55,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:55,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:55,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962097002] [2020-02-10 20:14:55,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:55,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:55,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:55,676 INFO L87 Difference]: Start difference. First operand 1569 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:14:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:55,865 INFO L93 Difference]: Finished difference Result 2923 states and 11666 transitions. [2020-02-10 20:14:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:55,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:55,873 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:14:55,873 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:14:55,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:14:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1573. [2020-02-10 20:14:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:14:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7053 transitions. [2020-02-10 20:14:55,938 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7053 transitions. Word has length 28 [2020-02-10 20:14:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:55,938 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7053 transitions. [2020-02-10 20:14:55,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7053 transitions. [2020-02-10 20:14:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:55,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:55,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:55,941 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:55,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:55,942 INFO L82 PathProgramCache]: Analyzing trace with hash -28408424, now seen corresponding path program 184 times [2020-02-10 20:14:55,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:55,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000327604] [2020-02-10 20:14:55,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:56,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000327604] [2020-02-10 20:14:56,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:56,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:56,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39509164] [2020-02-10 20:14:56,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:56,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:56,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:56,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:56,474 INFO L87 Difference]: Start difference. First operand 1573 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:14:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:56,688 INFO L93 Difference]: Finished difference Result 2922 states and 11660 transitions. [2020-02-10 20:14:56,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:56,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:56,695 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:14:56,695 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:14:56,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:14:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1569. [2020-02-10 20:14:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:14:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7042 transitions. [2020-02-10 20:14:56,761 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7042 transitions. Word has length 28 [2020-02-10 20:14:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:56,761 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7042 transitions. [2020-02-10 20:14:56,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7042 transitions. [2020-02-10 20:14:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:56,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:56,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:56,764 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1724660340, now seen corresponding path program 185 times [2020-02-10 20:14:56,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:56,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106865538] [2020-02-10 20:14:56,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:57,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106865538] [2020-02-10 20:14:57,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:57,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:57,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191209177] [2020-02-10 20:14:57,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:57,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:57,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:57,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:57,299 INFO L87 Difference]: Start difference. First operand 1569 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:14:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:57,525 INFO L93 Difference]: Finished difference Result 2929 states and 11674 transitions. [2020-02-10 20:14:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:57,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:57,533 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:14:57,533 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:14:57,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:14:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1573. [2020-02-10 20:14:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:14:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7049 transitions. [2020-02-10 20:14:57,597 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7049 transitions. Word has length 28 [2020-02-10 20:14:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:57,597 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7049 transitions. [2020-02-10 20:14:57,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7049 transitions. [2020-02-10 20:14:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:57,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:57,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:57,600 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:57,600 INFO L82 PathProgramCache]: Analyzing trace with hash 509447154, now seen corresponding path program 186 times [2020-02-10 20:14:57,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:57,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658130108] [2020-02-10 20:14:57,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658130108] [2020-02-10 20:14:58,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:58,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965349073] [2020-02-10 20:14:58,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:58,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:58,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:58,118 INFO L87 Difference]: Start difference. First operand 1573 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:14:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:58,364 INFO L93 Difference]: Finished difference Result 2925 states and 11662 transitions. [2020-02-10 20:14:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:58,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:58,372 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:14:58,372 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:14:58,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:58,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:14:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1565. [2020-02-10 20:14:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:14:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7031 transitions. [2020-02-10 20:14:58,436 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7031 transitions. Word has length 28 [2020-02-10 20:14:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:58,436 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7031 transitions. [2020-02-10 20:14:58,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7031 transitions. [2020-02-10 20:14:58,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:58,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:58,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, 1, 1, 1] [2020-02-10 20:14:58,438 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:58,439 INFO L82 PathProgramCache]: Analyzing trace with hash 15693908, now seen corresponding path program 187 times [2020-02-10 20:14:58,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:58,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389639587] [2020-02-10 20:14:58,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389639587] [2020-02-10 20:14:58,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:58,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163575452] [2020-02-10 20:14:58,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:58,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:58,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:58,959 INFO L87 Difference]: Start difference. First operand 1565 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:14:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:59,143 INFO L93 Difference]: Finished difference Result 2933 states and 11689 transitions. [2020-02-10 20:14:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:59,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:59,150 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:14:59,151 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 20:14:59,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:59,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 20:14:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1575. [2020-02-10 20:14:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:14:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7057 transitions. [2020-02-10 20:14:59,214 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7057 transitions. Word has length 28 [2020-02-10 20:14:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,215 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7057 transitions. [2020-02-10 20:14:59,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7057 transitions. [2020-02-10 20:14:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:59,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:59,217 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1505098904, now seen corresponding path program 188 times [2020-02-10 20:14:59,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765240094] [2020-02-10 20:14:59,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:59,723 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:14:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:59,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765240094] [2020-02-10 20:14:59,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:59,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:14:59,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448633522] [2020-02-10 20:14:59,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:14:59,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:59,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:14:59,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:59,731 INFO L87 Difference]: Start difference. First operand 1575 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:14:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:59,911 INFO L93 Difference]: Finished difference Result 2935 states and 11687 transitions. [2020-02-10 20:14:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:14:59,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:14:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:59,918 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 20:14:59,918 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:14:59,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:14:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:14:59,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1569. [2020-02-10 20:14:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:14:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7042 transitions. [2020-02-10 20:14:59,982 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7042 transitions. Word has length 28 [2020-02-10 20:14:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,982 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7042 transitions. [2020-02-10 20:14:59,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:14:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7042 transitions. [2020-02-10 20:14:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:14:59,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:59,985 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,985 INFO L82 PathProgramCache]: Analyzing trace with hash 553549486, now seen corresponding path program 189 times [2020-02-10 20:14:59,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163014686] [2020-02-10 20:14:59,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:00,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163014686] [2020-02-10 20:15:00,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:00,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:00,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970245358] [2020-02-10 20:15:00,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:00,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:00,526 INFO L87 Difference]: Start difference. First operand 1569 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:15:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:00,730 INFO L93 Difference]: Finished difference Result 2927 states and 11671 transitions. [2020-02-10 20:15:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:00,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:00,737 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:15:00,738 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:15:00,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:15:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1573. [2020-02-10 20:15:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:15:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7049 transitions. [2020-02-10 20:15:00,803 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7049 transitions. Word has length 28 [2020-02-10 20:15:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:00,803 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7049 transitions. [2020-02-10 20:15:00,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7049 transitions. [2020-02-10 20:15:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:00,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:00,806 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:00,806 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash -17905320, now seen corresponding path program 190 times [2020-02-10 20:15:00,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:00,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368628671] [2020-02-10 20:15:00,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:01,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368628671] [2020-02-10 20:15:01,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:01,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:01,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018618747] [2020-02-10 20:15:01,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:01,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:01,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:01,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:01,318 INFO L87 Difference]: Start difference. First operand 1573 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:15:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:01,559 INFO L93 Difference]: Finished difference Result 2925 states and 11663 transitions. [2020-02-10 20:15:01,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:01,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:01,567 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:15:01,567 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:15:01,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:15:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1569. [2020-02-10 20:15:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:15:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7038 transitions. [2020-02-10 20:15:01,631 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7038 transitions. Word has length 28 [2020-02-10 20:15:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:01,631 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7038 transitions. [2020-02-10 20:15:01,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7038 transitions. [2020-02-10 20:15:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:01,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:01,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:01,634 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash 969869102, now seen corresponding path program 191 times [2020-02-10 20:15:01,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:01,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43596037] [2020-02-10 20:15:01,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:02,168 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:15:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:02,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43596037] [2020-02-10 20:15:02,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:02,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:02,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345477950] [2020-02-10 20:15:02,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:02,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:02,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:02,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:02,176 INFO L87 Difference]: Start difference. First operand 1569 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:15:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:02,412 INFO L93 Difference]: Finished difference Result 2931 states and 11675 transitions. [2020-02-10 20:15:02,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:02,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:02,420 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 20:15:02,420 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:15:02,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:15:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1573. [2020-02-10 20:15:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:15:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7045 transitions. [2020-02-10 20:15:02,484 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7045 transitions. Word has length 28 [2020-02-10 20:15:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:02,484 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7045 transitions. [2020-02-10 20:15:02,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7045 transitions. [2020-02-10 20:15:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:02,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:02,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:02,487 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1090990700, now seen corresponding path program 192 times [2020-02-10 20:15:02,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:02,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600520600] [2020-02-10 20:15:02,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:03,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600520600] [2020-02-10 20:15:03,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:03,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:03,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340900011] [2020-02-10 20:15:03,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:03,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:03,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:03,010 INFO L87 Difference]: Start difference. First operand 1573 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:15:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:03,195 INFO L93 Difference]: Finished difference Result 2927 states and 11663 transitions. [2020-02-10 20:15:03,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:03,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:03,202 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:15:03,203 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:15:03,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:15:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1561. [2020-02-10 20:15:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:15:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7020 transitions. [2020-02-10 20:15:03,267 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7020 transitions. Word has length 28 [2020-02-10 20:15:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:03,267 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7020 transitions. [2020-02-10 20:15:03,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7020 transitions. [2020-02-10 20:15:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:03,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:03,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:03,269 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1682365546, now seen corresponding path program 193 times [2020-02-10 20:15:03,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:03,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959634763] [2020-02-10 20:15:03,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:03,839 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-02-10 20:15:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:03,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959634763] [2020-02-10 20:15:03,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:03,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:03,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178566903] [2020-02-10 20:15:03,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:03,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:03,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:03,848 INFO L87 Difference]: Start difference. First operand 1561 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:15:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,048 INFO L93 Difference]: Finished difference Result 2965 states and 11770 transitions. [2020-02-10 20:15:04,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:04,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,057 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:15:04,057 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:15:04,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:15:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1580. [2020-02-10 20:15:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:15:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7081 transitions. [2020-02-10 20:15:04,123 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7081 transitions. Word has length 28 [2020-02-10 20:15:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:04,123 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7081 transitions. [2020-02-10 20:15:04,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7081 transitions. [2020-02-10 20:15:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:04,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:04,125 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:04,126 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1123196754, now seen corresponding path program 194 times [2020-02-10 20:15:04,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:04,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234075010] [2020-02-10 20:15:04,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:04,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234075010] [2020-02-10 20:15:04,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:04,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:04,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5036448] [2020-02-10 20:15:04,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:04,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:04,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:04,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:04,661 INFO L87 Difference]: Start difference. First operand 1580 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:15:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,831 INFO L93 Difference]: Finished difference Result 2970 states and 11774 transitions. [2020-02-10 20:15:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:04,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,839 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:15:04,839 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:15:04,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:15:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1574. [2020-02-10 20:15:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:15:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7064 transitions. [2020-02-10 20:15:04,904 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7064 transitions. Word has length 28 [2020-02-10 20:15:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:04,904 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7064 transitions. [2020-02-10 20:15:04,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7064 transitions. [2020-02-10 20:15:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:04,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:04,907 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:04,907 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:04,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1001660792, now seen corresponding path program 195 times [2020-02-10 20:15:04,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:04,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132721345] [2020-02-10 20:15:04,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:05,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132721345] [2020-02-10 20:15:05,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:05,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:05,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77562746] [2020-02-10 20:15:05,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:05,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:05,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:05,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:05,458 INFO L87 Difference]: Start difference. First operand 1574 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:15:05,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:05,686 INFO L93 Difference]: Finished difference Result 2962 states and 11759 transitions. [2020-02-10 20:15:05,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:05,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:05,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:05,693 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:15:05,693 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:15:05,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:15:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1579. [2020-02-10 20:15:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:15:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7073 transitions. [2020-02-10 20:15:05,759 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7073 transitions. Word has length 28 [2020-02-10 20:15:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:05,759 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7073 transitions. [2020-02-10 20:15:05,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7073 transitions. [2020-02-10 20:15:05,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:05,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:05,762 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:05,762 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:05,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:05,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1232446702, now seen corresponding path program 196 times [2020-02-10 20:15:05,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:05,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043645552] [2020-02-10 20:15:05,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:06,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043645552] [2020-02-10 20:15:06,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:06,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:06,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972156253] [2020-02-10 20:15:06,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:06,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:06,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:06,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:06,277 INFO L87 Difference]: Start difference. First operand 1579 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:15:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:06,477 INFO L93 Difference]: Finished difference Result 2965 states and 11760 transitions. [2020-02-10 20:15:06,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:06,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:06,485 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:15:06,485 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:15:06,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:15:06,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1574. [2020-02-10 20:15:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:15:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7059 transitions. [2020-02-10 20:15:06,553 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7059 transitions. Word has length 28 [2020-02-10 20:15:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:06,553 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7059 transitions. [2020-02-10 20:15:06,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7059 transitions. [2020-02-10 20:15:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:06,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:06,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:06,558 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:06,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:06,558 INFO L82 PathProgramCache]: Analyzing trace with hash -585341176, now seen corresponding path program 197 times [2020-02-10 20:15:06,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:06,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437965140] [2020-02-10 20:15:06,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:07,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437965140] [2020-02-10 20:15:07,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:07,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:07,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175822424] [2020-02-10 20:15:07,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:07,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:07,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:07,104 INFO L87 Difference]: Start difference. First operand 1574 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:15:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:07,247 INFO L93 Difference]: Finished difference Result 2977 states and 11784 transitions. [2020-02-10 20:15:07,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:07,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:07,255 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:15:07,255 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:15:07,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:15:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1584. [2020-02-10 20:15:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:15:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7076 transitions. [2020-02-10 20:15:07,321 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7076 transitions. Word has length 28 [2020-02-10 20:15:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:07,321 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7076 transitions. [2020-02-10 20:15:07,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7076 transitions. [2020-02-10 20:15:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:07,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:07,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:07,324 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:07,324 INFO L82 PathProgramCache]: Analyzing trace with hash 159361322, now seen corresponding path program 198 times [2020-02-10 20:15:07,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:07,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233303172] [2020-02-10 20:15:07,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:07,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233303172] [2020-02-10 20:15:07,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:07,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:07,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049179545] [2020-02-10 20:15:07,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:07,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:07,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:07,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:07,845 INFO L87 Difference]: Start difference. First operand 1584 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:15:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:08,049 INFO L93 Difference]: Finished difference Result 2975 states and 11772 transitions. [2020-02-10 20:15:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:08,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:08,056 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 20:15:08,056 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:15:08,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:08,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:15:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1567. [2020-02-10 20:15:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:15:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7040 transitions. [2020-02-10 20:15:08,121 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7040 transitions. Word has length 28 [2020-02-10 20:15:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:08,121 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7040 transitions. [2020-02-10 20:15:08,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7040 transitions. [2020-02-10 20:15:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:08,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:08,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:08,124 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1176019280, now seen corresponding path program 199 times [2020-02-10 20:15:08,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:08,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592027071] [2020-02-10 20:15:08,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:08,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592027071] [2020-02-10 20:15:08,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:08,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:08,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52293609] [2020-02-10 20:15:08,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:08,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:08,653 INFO L87 Difference]: Start difference. First operand 1567 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:15:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:08,862 INFO L93 Difference]: Finished difference Result 2953 states and 11734 transitions. [2020-02-10 20:15:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:08,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:08,870 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:15:08,870 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:15:08,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:15:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1578. [2020-02-10 20:15:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:15:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7069 transitions. [2020-02-10 20:15:08,935 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7069 transitions. Word has length 28 [2020-02-10 20:15:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:08,936 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7069 transitions. [2020-02-10 20:15:08,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7069 transitions. [2020-02-10 20:15:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:08,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:08,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:08,938 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:08,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1629543020, now seen corresponding path program 200 times [2020-02-10 20:15:08,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:08,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918873357] [2020-02-10 20:15:08,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:09,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918873357] [2020-02-10 20:15:09,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:09,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:09,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681918955] [2020-02-10 20:15:09,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:09,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:09,452 INFO L87 Difference]: Start difference. First operand 1578 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:15:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:09,592 INFO L93 Difference]: Finished difference Result 2958 states and 11738 transitions. [2020-02-10 20:15:09,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:09,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:09,600 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:15:09,600 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:15:09,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:15:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1572. [2020-02-10 20:15:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:15:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7053 transitions. [2020-02-10 20:15:09,686 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7053 transitions. Word has length 28 [2020-02-10 20:15:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:09,686 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7053 transitions. [2020-02-10 20:15:09,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7053 transitions. [2020-02-10 20:15:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:09,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:09,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:09,689 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash -970151480, now seen corresponding path program 201 times [2020-02-10 20:15:09,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:09,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059000102] [2020-02-10 20:15:09,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15: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-02-10 20:15:10,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059000102] [2020-02-10 20:15:10,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:10,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:10,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568266447] [2020-02-10 20:15:10,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:10,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:10,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:10,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:10,215 INFO L87 Difference]: Start difference. First operand 1572 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:15:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:10,428 INFO L93 Difference]: Finished difference Result 2945 states and 11713 transitions. [2020-02-10 20:15:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:10,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:10,435 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:15:10,435 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:15:10,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:10,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:15:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:15:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:15:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7060 transitions. [2020-02-10 20:15:10,501 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7060 transitions. Word has length 28 [2020-02-10 20:15:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:10,501 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7060 transitions. [2020-02-10 20:15:10,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7060 transitions. [2020-02-10 20:15:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:10,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:10,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:10,504 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:10,504 INFO L82 PathProgramCache]: Analyzing trace with hash -796903788, now seen corresponding path program 202 times [2020-02-10 20:15:10,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:10,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544931300] [2020-02-10 20:15:10,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:11,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544931300] [2020-02-10 20:15:11,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:11,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:11,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086224464] [2020-02-10 20:15:11,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:11,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:11,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:11,043 INFO L87 Difference]: Start difference. First operand 1576 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:15:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:11,236 INFO L93 Difference]: Finished difference Result 2944 states and 11707 transitions. [2020-02-10 20:15:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:11,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:11,244 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:15:11,244 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:15:11,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:15:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1572. [2020-02-10 20:15:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:15:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7049 transitions. [2020-02-10 20:15:11,311 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7049 transitions. Word has length 28 [2020-02-10 20:15:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:11,311 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7049 transitions. [2020-02-10 20:15:11,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7049 transitions. [2020-02-10 20:15:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:11,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:11,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:11,313 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:11,314 INFO L82 PathProgramCache]: Analyzing trace with hash -553831864, now seen corresponding path program 203 times [2020-02-10 20:15:11,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:11,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608361543] [2020-02-10 20:15:11,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:11,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608361543] [2020-02-10 20:15:11,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:11,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:11,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636209544] [2020-02-10 20:15:11,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:11,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:11,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:11,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:11,845 INFO L87 Difference]: Start difference. First operand 1572 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:15:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:12,017 INFO L93 Difference]: Finished difference Result 2956 states and 11729 transitions. [2020-02-10 20:15:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:12,017 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:12,025 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:15:12,025 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:15:12,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:15:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1577. [2020-02-10 20:15:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:15:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7057 transitions. [2020-02-10 20:15:12,092 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7057 transitions. Word has length 28 [2020-02-10 20:15:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:12,092 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7057 transitions. [2020-02-10 20:15:12,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7057 transitions. [2020-02-10 20:15:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:12,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:12,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:12,094 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:12,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1869989168, now seen corresponding path program 204 times [2020-02-10 20:15:12,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:12,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480188090] [2020-02-10 20:15:12,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:12,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480188090] [2020-02-10 20:15:12,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:12,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:12,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811464477] [2020-02-10 20:15:12,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:12,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:12,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:12,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:12,613 INFO L87 Difference]: Start difference. First operand 1577 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:15:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:12,799 INFO L93 Difference]: Finished difference Result 2950 states and 11713 transitions. [2020-02-10 20:15:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:12,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:12,806 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:15:12,806 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:15:12,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:15:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1567. [2020-02-10 20:15:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:15:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7035 transitions. [2020-02-10 20:15:12,870 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7035 transitions. Word has length 28 [2020-02-10 20:15:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:12,870 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7035 transitions. [2020-02-10 20:15:12,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7035 transitions. [2020-02-10 20:15:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:12,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:12,872 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:12,873 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:12,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:12,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1186522384, now seen corresponding path program 205 times [2020-02-10 20:15:12,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:12,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664542049] [2020-02-10 20:15:12,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:13,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664542049] [2020-02-10 20:15:13,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:13,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:13,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818697626] [2020-02-10 20:15:13,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:13,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:13,379 INFO L87 Difference]: Start difference. First operand 1567 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:15:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:13,570 INFO L93 Difference]: Finished difference Result 2945 states and 11714 transitions. [2020-02-10 20:15:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:13,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:13,578 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:15:13,578 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:15:13,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:15:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:15:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:15:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7059 transitions. [2020-02-10 20:15:13,647 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7059 transitions. Word has length 28 [2020-02-10 20:15:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:13,647 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7059 transitions. [2020-02-10 20:15:13,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7059 transitions. [2020-02-10 20:15:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:13,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:13,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:13,650 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash -874337418, now seen corresponding path program 206 times [2020-02-10 20:15:13,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:13,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848757229] [2020-02-10 20:15:13,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848757229] [2020-02-10 20:15:14,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:14,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098709398] [2020-02-10 20:15:14,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:14,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:14,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:14,174 INFO L87 Difference]: Start difference. First operand 1576 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:15:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:14,389 INFO L93 Difference]: Finished difference Result 2948 states and 11715 transitions. [2020-02-10 20:15:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:14,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:14,397 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:15:14,398 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:15:14,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:15:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 20:15:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:15:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7046 transitions. [2020-02-10 20:15:14,460 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7046 transitions. Word has length 28 [2020-02-10 20:15:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:14,461 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7046 transitions. [2020-02-10 20:15:14,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7046 transitions. [2020-02-10 20:15:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:14,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:14,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, 1, 1, 1] [2020-02-10 20:15:14,463 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1724377962, now seen corresponding path program 207 times [2020-02-10 20:15:14,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:14,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803518451] [2020-02-10 20:15:14,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803518451] [2020-02-10 20:15:14,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:14,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571150781] [2020-02-10 20:15:14,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:14,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:14,993 INFO L87 Difference]: Start difference. First operand 1571 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:15:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:15,257 INFO L93 Difference]: Finished difference Result 2940 states and 11699 transitions. [2020-02-10 20:15:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:15,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:15,265 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:15:15,265 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:15:15,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:15:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1575. [2020-02-10 20:15:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:15:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7053 transitions. [2020-02-10 20:15:15,331 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7053 transitions. Word has length 28 [2020-02-10 20:15:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:15,331 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7053 transitions. [2020-02-10 20:15:15,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7053 transitions. [2020-02-10 20:15:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:15,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:15,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, 1, 1, 1] [2020-02-10 20:15:15,333 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:15,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1897625654, now seen corresponding path program 208 times [2020-02-10 20:15:15,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:15,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861761001] [2020-02-10 20:15:15,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:15,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861761001] [2020-02-10 20:15:15,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:15,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:15,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528002396] [2020-02-10 20:15:15,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:15,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:15,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:15,863 INFO L87 Difference]: Start difference. First operand 1575 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:15:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,078 INFO L93 Difference]: Finished difference Result 2939 states and 11693 transitions. [2020-02-10 20:15:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:16,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,086 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:15:16,086 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:15:16,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:15:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1571. [2020-02-10 20:15:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:15:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7042 transitions. [2020-02-10 20:15:16,151 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7042 transitions. Word has length 28 [2020-02-10 20:15:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:16,151 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7042 transitions. [2020-02-10 20:15:16,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7042 transitions. [2020-02-10 20:15:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:16,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:16,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:16,153 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash 201373738, now seen corresponding path program 209 times [2020-02-10 20:15:16,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:16,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651531091] [2020-02-10 20:15:16,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:16,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651531091] [2020-02-10 20:15:16,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:16,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:16,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407732841] [2020-02-10 20:15:16,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:16,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:16,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:16,672 INFO L87 Difference]: Start difference. First operand 1571 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:15:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,938 INFO L93 Difference]: Finished difference Result 2946 states and 11707 transitions. [2020-02-10 20:15:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:16,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,946 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:15:16,946 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:15:16,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:15:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1575. [2020-02-10 20:15:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:15:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7049 transitions. [2020-02-10 20:15:17,011 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7049 transitions. Word has length 28 [2020-02-10 20:15:17,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,012 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7049 transitions. [2020-02-10 20:15:17,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7049 transitions. [2020-02-10 20:15:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:17,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:17,014 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1859486064, now seen corresponding path program 210 times [2020-02-10 20:15:17,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986645030] [2020-02-10 20:15:17,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15: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-02-10 20:15:17,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986645030] [2020-02-10 20:15:17,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:17,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:17,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159582154] [2020-02-10 20:15:17,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:17,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:17,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:17,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:17,528 INFO L87 Difference]: Start difference. First operand 1575 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:15:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:17,800 INFO L93 Difference]: Finished difference Result 2942 states and 11695 transitions. [2020-02-10 20:15:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:17,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:17,808 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:15:17,808 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:15:17,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:15:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1567. [2020-02-10 20:15:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:15:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7031 transitions. [2020-02-10 20:15:17,871 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7031 transitions. Word has length 28 [2020-02-10 20:15:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,871 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7031 transitions. [2020-02-10 20:15:17,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7031 transitions. [2020-02-10 20:15:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:17,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,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, 1, 1, 1] [2020-02-10 20:15:17,874 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1598033708, now seen corresponding path program 211 times [2020-02-10 20:15:17,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917542194] [2020-02-10 20:15:17,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:18,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917542194] [2020-02-10 20:15:18,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:18,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:18,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995243228] [2020-02-10 20:15:18,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:18,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:18,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:18,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:18,413 INFO L87 Difference]: Start difference. First operand 1567 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:15:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:18,593 INFO L93 Difference]: Finished difference Result 2973 states and 11768 transitions. [2020-02-10 20:15:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:18,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:18,600 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:15:18,600 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:15:18,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:15:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1583. [2020-02-10 20:15:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:15:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7068 transitions. [2020-02-10 20:15:18,665 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7068 transitions. Word has length 28 [2020-02-10 20:15:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:18,665 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7068 transitions. [2020-02-10 20:15:18,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7068 transitions. [2020-02-10 20:15:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:18,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:18,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:18,668 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash -853331210, now seen corresponding path program 212 times [2020-02-10 20:15:18,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:18,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085177504] [2020-02-10 20:15:18,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:19,111 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 20:15:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:19,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085177504] [2020-02-10 20:15:19,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:19,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:19,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578774658] [2020-02-10 20:15:19,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:19,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:19,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:19,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:19,230 INFO L87 Difference]: Start difference. First operand 1583 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:15:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:19,489 INFO L93 Difference]: Finished difference Result 2971 states and 11756 transitions. [2020-02-10 20:15:19,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:19,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:19,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:19,496 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 20:15:19,496 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:15:19,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:15:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1573. [2020-02-10 20:15:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:15:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7045 transitions. [2020-02-10 20:15:19,560 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7045 transitions. Word has length 28 [2020-02-10 20:15:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:19,560 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7045 transitions. [2020-02-10 20:15:19,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7045 transitions. [2020-02-10 20:15:19,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:19,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:19,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:19,563 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:19,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:19,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1060178130, now seen corresponding path program 213 times [2020-02-10 20:15:19,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:19,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600984150] [2020-02-10 20:15:19,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:20,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600984150] [2020-02-10 20:15:20,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:20,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:20,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37358970] [2020-02-10 20:15:20,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:20,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:20,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:20,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:20,084 INFO L87 Difference]: Start difference. First operand 1573 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:15:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:20,315 INFO L93 Difference]: Finished difference Result 2964 states and 11741 transitions. [2020-02-10 20:15:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:20,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:20,323 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:15:20,323 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:15:20,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:15:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1578. [2020-02-10 20:15:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:15:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7053 transitions. [2020-02-10 20:15:20,389 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7053 transitions. Word has length 28 [2020-02-10 20:15:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:20,389 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7053 transitions. [2020-02-10 20:15:20,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7053 transitions. [2020-02-10 20:15:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:20,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:20,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:20,392 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:20,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:20,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1918631862, now seen corresponding path program 214 times [2020-02-10 20:15:20,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:20,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995874503] [2020-02-10 20:15:20,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:20,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995874503] [2020-02-10 20:15:20,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:20,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:20,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225817701] [2020-02-10 20:15:20,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:20,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:20,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:20,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:20,910 INFO L87 Difference]: Start difference. First operand 1578 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:15:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:21,112 INFO L93 Difference]: Finished difference Result 2958 states and 11725 transitions. [2020-02-10 20:15:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:21,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:21,120 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:15:21,120 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:15:21,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:15:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1573. [2020-02-10 20:15:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:15:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7040 transitions. [2020-02-10 20:15:21,185 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7040 transitions. Word has length 28 [2020-02-10 20:15:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:21,185 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7040 transitions. [2020-02-10 20:15:21,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7040 transitions. [2020-02-10 20:15:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:21,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:21,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:21,188 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:21,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:21,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1295465326, now seen corresponding path program 215 times [2020-02-10 20:15:21,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:21,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070491110] [2020-02-10 20:15:21,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:21,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070491110] [2020-02-10 20:15:21,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:21,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:21,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803758997] [2020-02-10 20:15:21,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:21,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:21,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:21,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:21,727 INFO L87 Difference]: Start difference. First operand 1573 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:15:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:22,002 INFO L93 Difference]: Finished difference Result 2959 states and 11728 transitions. [2020-02-10 20:15:22,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:22,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:22,009 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:15:22,009 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:15:22,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:15:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1577. [2020-02-10 20:15:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:15:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7047 transitions. [2020-02-10 20:15:22,075 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7047 transitions. Word has length 28 [2020-02-10 20:15:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:22,075 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7047 transitions. [2020-02-10 20:15:22,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7047 transitions. [2020-02-10 20:15:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:22,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:22,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:22,078 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:22,078 INFO L82 PathProgramCache]: Analyzing trace with hash -765394476, now seen corresponding path program 216 times [2020-02-10 20:15:22,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:22,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617518171] [2020-02-10 20:15:22,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:22,596 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:15:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:22,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617518171] [2020-02-10 20:15:22,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:22,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:22,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610725214] [2020-02-10 20:15:22,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:22,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:22,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:22,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:22,604 INFO L87 Difference]: Start difference. First operand 1577 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:15:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:22,882 INFO L93 Difference]: Finished difference Result 2955 states and 11716 transitions. [2020-02-10 20:15:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:22,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:22,889 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:15:22,889 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:15:22,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:15:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1561. [2020-02-10 20:15:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:15:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7014 transitions. [2020-02-10 20:15:22,955 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7014 transitions. Word has length 28 [2020-02-10 20:15:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:22,955 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7014 transitions. [2020-02-10 20:15:22,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7014 transitions. [2020-02-10 20:15:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:22,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:22,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:22,958 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash 68637930, now seen corresponding path program 217 times [2020-02-10 20:15:22,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:22,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823114319] [2020-02-10 20:15:22,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:23,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823114319] [2020-02-10 20:15:23,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:23,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:23,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126212935] [2020-02-10 20:15:23,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:23,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:23,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:23,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:23,481 INFO L87 Difference]: Start difference. First operand 1561 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:15:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:23,672 INFO L93 Difference]: Finished difference Result 2976 states and 11795 transitions. [2020-02-10 20:15:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:23,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:23,680 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:15:23,680 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:15:23,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:15:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1582. [2020-02-10 20:15:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:15:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7081 transitions. [2020-02-10 20:15:23,746 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7081 transitions. Word has length 28 [2020-02-10 20:15:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:23,746 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7081 transitions. [2020-02-10 20:15:23,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7081 transitions. [2020-02-10 20:15:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:23,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:23,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:23,749 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:23,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash 813340428, now seen corresponding path program 218 times [2020-02-10 20:15:23,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:23,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452956704] [2020-02-10 20:15:23,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:24,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452956704] [2020-02-10 20:15:24,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:24,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:24,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552014688] [2020-02-10 20:15:24,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:24,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:24,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:24,308 INFO L87 Difference]: Start difference. First operand 1582 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:15:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:24,459 INFO L93 Difference]: Finished difference Result 2980 states and 11796 transitions. [2020-02-10 20:15:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:24,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:24,466 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:15:24,466 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:15:24,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:15:24,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1575. [2020-02-10 20:15:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:15:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7061 transitions. [2020-02-10 20:15:24,532 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7061 transitions. Word has length 28 [2020-02-10 20:15:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:24,532 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7061 transitions. [2020-02-10 20:15:24,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7061 transitions. [2020-02-10 20:15:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:24,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:24,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:24,535 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:24,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:24,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1679578888, now seen corresponding path program 219 times [2020-02-10 20:15:24,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:24,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662701215] [2020-02-10 20:15:24,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:25,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662701215] [2020-02-10 20:15:25,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:25,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:25,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804762106] [2020-02-10 20:15:25,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:25,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:25,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:25,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:25,055 INFO L87 Difference]: Start difference. First operand 1575 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:15:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:25,227 INFO L93 Difference]: Finished difference Result 2973 states and 11783 transitions. [2020-02-10 20:15:25,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:25,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:25,235 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:15:25,235 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:15:25,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:15:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1581. [2020-02-10 20:15:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:15:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7072 transitions. [2020-02-10 20:15:25,300 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7072 transitions. Word has length 28 [2020-02-10 20:15:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:25,300 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7072 transitions. [2020-02-10 20:15:25,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7072 transitions. [2020-02-10 20:15:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:25,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:25,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:25,303 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:25,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:25,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1125983412, now seen corresponding path program 220 times [2020-02-10 20:15:25,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:25,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581569740] [2020-02-10 20:15:25,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:25,811 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:15:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:25,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581569740] [2020-02-10 20:15:25,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:25,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:25,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155772133] [2020-02-10 20:15:25,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:25,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:25,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:25,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:25,818 INFO L87 Difference]: Start difference. First operand 1581 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:15:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:25,987 INFO L93 Difference]: Finished difference Result 2975 states and 11781 transitions. [2020-02-10 20:15:25,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:25,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:25,995 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 20:15:25,995 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:15:25,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:15:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1575. [2020-02-10 20:15:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:15:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7055 transitions. [2020-02-10 20:15:26,060 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7055 transitions. Word has length 28 [2020-02-10 20:15:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:26,060 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7055 transitions. [2020-02-10 20:15:26,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7055 transitions. [2020-02-10 20:15:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:26,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:26,063 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:26,063 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:26,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:26,063 INFO L82 PathProgramCache]: Analyzing trace with hash -259744952, now seen corresponding path program 221 times [2020-02-10 20:15:26,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:26,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883867757] [2020-02-10 20:15:26,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:26,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883867757] [2020-02-10 20:15:26,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:26,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:26,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871314055] [2020-02-10 20:15:26,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:26,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:26,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:26,621 INFO L87 Difference]: Start difference. First operand 1575 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:15:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:26,750 INFO L93 Difference]: Finished difference Result 2985 states and 11800 transitions. [2020-02-10 20:15:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:26,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:26,758 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:15:26,758 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:15:26,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:15:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1585. [2020-02-10 20:15:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:15:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7072 transitions. [2020-02-10 20:15:26,823 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7072 transitions. Word has length 28 [2020-02-10 20:15:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:26,824 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7072 transitions. [2020-02-10 20:15:26,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7072 transitions. [2020-02-10 20:15:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:26,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:26,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:26,826 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:26,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash 484957546, now seen corresponding path program 222 times [2020-02-10 20:15:26,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:26,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740960468] [2020-02-10 20:15:26,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:27,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740960468] [2020-02-10 20:15:27,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:27,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:27,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970755763] [2020-02-10 20:15:27,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:27,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:27,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:27,368 INFO L87 Difference]: Start difference. First operand 1585 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:15:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:27,544 INFO L93 Difference]: Finished difference Result 2983 states and 11788 transitions. [2020-02-10 20:15:27,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:27,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:27,552 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:15:27,552 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:15:27,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:15:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1567. [2020-02-10 20:15:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:15:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7034 transitions. [2020-02-10 20:15:27,616 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7034 transitions. Word has length 28 [2020-02-10 20:15:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:27,616 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7034 transitions. [2020-02-10 20:15:27,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7034 transitions. [2020-02-10 20:15:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:27,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:27,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:27,619 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash -437708336, now seen corresponding path program 223 times [2020-02-10 20:15:27,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:27,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976891407] [2020-02-10 20:15:27,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:28,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976891407] [2020-02-10 20:15:28,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:28,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:28,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682922567] [2020-02-10 20:15:28,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:28,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:28,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:28,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:28,152 INFO L87 Difference]: Start difference. First operand 1567 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:15:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:28,342 INFO L93 Difference]: Finished difference Result 2962 states and 11752 transitions. [2020-02-10 20:15:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:28,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:28,350 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:15:28,350 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:15:28,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:15:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1579. [2020-02-10 20:15:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:15:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7065 transitions. [2020-02-10 20:15:28,414 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7065 transitions. Word has length 28 [2020-02-10 20:15:28,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:28,414 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7065 transitions. [2020-02-10 20:15:28,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7065 transitions. [2020-02-10 20:15:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:28,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:28,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:28,417 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash 306994162, now seen corresponding path program 224 times [2020-02-10 20:15:28,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:28,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260974279] [2020-02-10 20:15:28,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:28,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260974279] [2020-02-10 20:15:28,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:28,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:28,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565966316] [2020-02-10 20:15:28,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:28,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:28,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:28,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:28,982 INFO L87 Difference]: Start difference. First operand 1579 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:15:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:29,111 INFO L93 Difference]: Finished difference Result 2966 states and 11753 transitions. [2020-02-10 20:15:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:29,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:29,118 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:15:29,118 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:15:29,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:15:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1572. [2020-02-10 20:15:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:15:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7047 transitions. [2020-02-10 20:15:29,181 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7047 transitions. Word has length 28 [2020-02-10 20:15:29,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:29,181 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7047 transitions. [2020-02-10 20:15:29,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7047 transitions. [2020-02-10 20:15:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:29,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:29,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:29,184 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:29,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:29,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1711088200, now seen corresponding path program 225 times [2020-02-10 20:15:29,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:29,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131623096] [2020-02-10 20:15:29,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:29,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131623096] [2020-02-10 20:15:29,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:29,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:29,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075884712] [2020-02-10 20:15:29,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:29,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:29,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:29,716 INFO L87 Difference]: Start difference. First operand 1572 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:15:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:29,911 INFO L93 Difference]: Finished difference Result 2953 states and 11728 transitions. [2020-02-10 20:15:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:29,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:29,918 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:15:29,918 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:15:29,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:15:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1576. [2020-02-10 20:15:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:15:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 20:15:29,983 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 20:15:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:29,983 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 20:15:29,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 20:15:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:29,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:29,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:29,986 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1139633394, now seen corresponding path program 226 times [2020-02-10 20:15:29,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:29,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448267830] [2020-02-10 20:15:29,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:30,420 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:15:30,567 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:15: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-02-10 20:15:30,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448267830] [2020-02-10 20:15:30,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:30,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:30,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225113561] [2020-02-10 20:15:30,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:30,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:30,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:30,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:30,578 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:15:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:30,756 INFO L93 Difference]: Finished difference Result 2951 states and 11720 transitions. [2020-02-10 20:15:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:30,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:30,763 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:15:30,763 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:15:30,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:15:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 20:15:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:15:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7043 transitions. [2020-02-10 20:15:30,826 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7043 transitions. Word has length 28 [2020-02-10 20:15:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:30,826 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7043 transitions. [2020-02-10 20:15:30,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7043 transitions. [2020-02-10 20:15:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:30,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:30,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:30,829 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash -228235640, now seen corresponding path program 227 times [2020-02-10 20:15:30,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:30,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443773590] [2020-02-10 20:15:30,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:31,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443773590] [2020-02-10 20:15:31,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:31,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:31,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249123280] [2020-02-10 20:15:31,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:31,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:31,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:31,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:31,352 INFO L87 Difference]: Start difference. First operand 1572 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:15:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:31,515 INFO L93 Difference]: Finished difference Result 2962 states and 11740 transitions. [2020-02-10 20:15:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:31,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:31,523 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:15:31,523 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:15:31,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:15:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1577. [2020-02-10 20:15:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:15:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7051 transitions. [2020-02-10 20:15:31,587 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7051 transitions. Word has length 28 [2020-02-10 20:15:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:31,587 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7051 transitions. [2020-02-10 20:15:31,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7051 transitions. [2020-02-10 20:15:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:31,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:31,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:31,589 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:31,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:31,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1544392944, now seen corresponding path program 228 times [2020-02-10 20:15:31,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:31,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935121224] [2020-02-10 20:15:31,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:32,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935121224] [2020-02-10 20:15:32,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:32,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:32,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313248805] [2020-02-10 20:15:32,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:32,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:32,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:32,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:32,108 INFO L87 Difference]: Start difference. First operand 1577 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:15:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:32,297 INFO L93 Difference]: Finished difference Result 2956 states and 11724 transitions. [2020-02-10 20:15:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:32,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:32,304 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:15:32,304 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:15:32,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:15:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1567. [2020-02-10 20:15:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:15:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 20:15:32,367 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 20:15:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:32,368 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 20:15:32,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 20:15:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:32,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15: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, 1, 1, 1] [2020-02-10 20:15:32,370 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:32,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash -427205232, now seen corresponding path program 229 times [2020-02-10 20:15:32,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:32,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099366874] [2020-02-10 20:15:32,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:32,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099366874] [2020-02-10 20:15:32,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:32,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:32,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319090694] [2020-02-10 20:15:32,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:32,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:32,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:32,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:32,891 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:15:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:33,074 INFO L93 Difference]: Finished difference Result 2954 states and 11732 transitions. [2020-02-10 20:15:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:33,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:33,082 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:15:33,082 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:15:33,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:15:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 20:15:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:15:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7055 transitions. [2020-02-10 20:15:33,146 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7055 transitions. Word has length 28 [2020-02-10 20:15:33,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:33,146 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7055 transitions. [2020-02-10 20:15:33,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:33,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7055 transitions. [2020-02-10 20:15:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:33,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:33,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:33,170 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:33,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1062199764, now seen corresponding path program 230 times [2020-02-10 20:15:33,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:33,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597690291] [2020-02-10 20:15:33,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:33,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597690291] [2020-02-10 20:15:33,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:33,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:33,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62024599] [2020-02-10 20:15:33,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:33,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:33,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:33,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:33,677 INFO L87 Difference]: Start difference. First operand 1577 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:15:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:33,866 INFO L93 Difference]: Finished difference Result 2956 states and 11730 transitions. [2020-02-10 20:15:33,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:33,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:33,874 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:15:33,874 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:15:33,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:15:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1571. [2020-02-10 20:15:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:15:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:15:33,937 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:15:33,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:33,937 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:15:33,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:15:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:33,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:33,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:33,940 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash 110650346, now seen corresponding path program 231 times [2020-02-10 20:15:33,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:33,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579268563] [2020-02-10 20:15:33,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:34,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579268563] [2020-02-10 20:15:34,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:34,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:34,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336475504] [2020-02-10 20:15:34,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:34,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:34,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:34,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:34,465 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:15:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:34,670 INFO L93 Difference]: Finished difference Result 2948 states and 11714 transitions. [2020-02-10 20:15:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:34,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:34,678 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:15:34,678 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:15:34,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:15:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1575. [2020-02-10 20:15:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:15:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7047 transitions. [2020-02-10 20:15:34,742 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7047 transitions. Word has length 28 [2020-02-10 20:15:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:34,742 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7047 transitions. [2020-02-10 20:15:34,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7047 transitions. [2020-02-10 20:15:34,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:34,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:34,744 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:34,744 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:34,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:34,745 INFO L82 PathProgramCache]: Analyzing trace with hash -460804460, now seen corresponding path program 232 times [2020-02-10 20:15:34,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:34,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788280604] [2020-02-10 20:15:34,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:35,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788280604] [2020-02-10 20:15:35,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:35,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:35,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818338017] [2020-02-10 20:15:35,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:35,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:35,259 INFO L87 Difference]: Start difference. First operand 1575 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:15:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:35,472 INFO L93 Difference]: Finished difference Result 2946 states and 11706 transitions. [2020-02-10 20:15:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:35,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:35,480 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:15:35,480 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:15:35,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:15:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1571. [2020-02-10 20:15:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:15:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:15:35,543 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:15:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:35,544 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:15:35,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:15:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:35,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:35,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, 1, 1, 1] [2020-02-10 20:15:35,546 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:35,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash 526969962, now seen corresponding path program 233 times [2020-02-10 20:15:35,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:35,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8776566] [2020-02-10 20:15:35,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:36,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:36,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8776566] [2020-02-10 20:15:36,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:36,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:36,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034253294] [2020-02-10 20:15:36,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:36,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:36,057 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:15:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:36,231 INFO L93 Difference]: Finished difference Result 2952 states and 11718 transitions. [2020-02-10 20:15:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:36,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:36,239 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:15:36,239 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:15:36,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:15:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1575. [2020-02-10 20:15:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:15:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7043 transitions. [2020-02-10 20:15:36,302 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7043 transitions. Word has length 28 [2020-02-10 20:15:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:36,302 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7043 transitions. [2020-02-10 20:15:36,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7043 transitions. [2020-02-10 20:15:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:36,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:36,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:36,305 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:36,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1533889840, now seen corresponding path program 234 times [2020-02-10 20:15:36,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:36,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298178532] [2020-02-10 20:15:36,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:36,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298178532] [2020-02-10 20:15:36,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:36,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:36,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219888930] [2020-02-10 20:15:36,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:36,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:36,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:36,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:36,821 INFO L87 Difference]: Start difference. First operand 1575 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:15:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:37,003 INFO L93 Difference]: Finished difference Result 2948 states and 11706 transitions. [2020-02-10 20:15:37,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:37,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:37,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:37,010 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:15:37,010 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:15:37,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:15:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1567. [2020-02-10 20:15:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:15:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:15:37,074 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:15:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:37,074 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:15:37,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:15:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:37,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:37,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:37,076 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:37,077 INFO L82 PathProgramCache]: Analyzing trace with hash 328000370, now seen corresponding path program 235 times [2020-02-10 20:15:37,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:37,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845603304] [2020-02-10 20:15:37,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:37,624 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:15:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:37,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845603304] [2020-02-10 20:15:37,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:37,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:37,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998952833] [2020-02-10 20:15:37,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:37,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:37,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:37,632 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:15:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:37,776 INFO L93 Difference]: Finished difference Result 2977 states and 11774 transitions. [2020-02-10 20:15:37,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:37,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:37,784 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:15:37,784 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:15:37,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:15:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1583. [2020-02-10 20:15:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:15:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7062 transitions. [2020-02-10 20:15:37,876 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7062 transitions. Word has length 28 [2020-02-10 20:15:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:37,876 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7062 transitions. [2020-02-10 20:15:37,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7062 transitions. [2020-02-10 20:15:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:37,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:37,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, 1, 1, 1] [2020-02-10 20:15:37,878 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:37,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:37,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1072702868, now seen corresponding path program 236 times [2020-02-10 20:15:37,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:37,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935829419] [2020-02-10 20:15:37,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:38,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935829419] [2020-02-10 20:15:38,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:38,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:38,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557220377] [2020-02-10 20:15:38,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:38,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:38,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:38,420 INFO L87 Difference]: Start difference. First operand 1583 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:15:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:38,601 INFO L93 Difference]: Finished difference Result 2975 states and 11762 transitions. [2020-02-10 20:15:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:38,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:38,614 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 20:15:38,614 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:15:38,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:15:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1573. [2020-02-10 20:15:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:15:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7039 transitions. [2020-02-10 20:15:38,705 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7039 transitions. Word has length 28 [2020-02-10 20:15:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:38,705 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7039 transitions. [2020-02-10 20:15:38,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7039 transitions. [2020-02-10 20:15:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:38,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:38,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:38,707 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:38,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash 865855948, now seen corresponding path program 237 times [2020-02-10 20:15:38,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:38,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913622593] [2020-02-10 20:15:38,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:39,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913622593] [2020-02-10 20:15:39,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:39,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:39,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732026180] [2020-02-10 20:15:39,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:39,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:39,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:39,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:39,235 INFO L87 Difference]: Start difference. First operand 1573 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:15:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:39,376 INFO L93 Difference]: Finished difference Result 2968 states and 11747 transitions. [2020-02-10 20:15:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:39,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:39,384 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:15:39,384 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:15:39,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:15:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1578. [2020-02-10 20:15:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:15:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7047 transitions. [2020-02-10 20:15:39,447 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7047 transitions. Word has length 28 [2020-02-10 20:15:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:39,448 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7047 transitions. [2020-02-10 20:15:39,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7047 transitions. [2020-02-10 20:15:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:39,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:39,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:39,450 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:39,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash -450301356, now seen corresponding path program 238 times [2020-02-10 20:15:39,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:39,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377604316] [2020-02-10 20:15:39,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:39,974 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:15:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:39,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377604316] [2020-02-10 20:15:39,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:39,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:39,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748865593] [2020-02-10 20:15:39,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:39,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:39,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:39,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:39,983 INFO L87 Difference]: Start difference. First operand 1578 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:15:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:40,181 INFO L93 Difference]: Finished difference Result 2962 states and 11731 transitions. [2020-02-10 20:15:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:40,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:40,189 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:15:40,189 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:15:40,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:15:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1573. [2020-02-10 20:15:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:15:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7034 transitions. [2020-02-10 20:15:40,254 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7034 transitions. Word has length 28 [2020-02-10 20:15:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:40,254 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7034 transitions. [2020-02-10 20:15:40,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7034 transitions. [2020-02-10 20:15:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:40,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:40,257 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:40,257 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:40,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1073467892, now seen corresponding path program 239 times [2020-02-10 20:15:40,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:40,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806884699] [2020-02-10 20:15:40,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:40,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806884699] [2020-02-10 20:15:40,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:40,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:40,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700382323] [2020-02-10 20:15:40,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:40,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:40,788 INFO L87 Difference]: Start difference. First operand 1573 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:15:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:40,975 INFO L93 Difference]: Finished difference Result 2963 states and 11734 transitions. [2020-02-10 20:15:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:40,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:40,983 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:15:40,983 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:15:40,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:15:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1577. [2020-02-10 20:15:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:15:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7041 transitions. [2020-02-10 20:15:41,047 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7041 transitions. Word has length 28 [2020-02-10 20:15:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:41,048 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7041 transitions. [2020-02-10 20:15:41,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7041 transitions. [2020-02-10 20:15:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:41,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:41,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:41,050 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:41,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:41,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1160639602, now seen corresponding path program 240 times [2020-02-10 20:15:41,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:41,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774600803] [2020-02-10 20:15:41,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:41,595 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:15:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:41,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774600803] [2020-02-10 20:15:41,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:41,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:41,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868262175] [2020-02-10 20:15:41,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:41,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:41,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:41,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:41,603 INFO L87 Difference]: Start difference. First operand 1577 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:15:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:41,789 INFO L93 Difference]: Finished difference Result 2959 states and 11722 transitions. [2020-02-10 20:15:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:41,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:41,797 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:15:41,797 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 20:15:41,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 20:15:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1555. [2020-02-10 20:15:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 20:15:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6997 transitions. [2020-02-10 20:15:41,862 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6997 transitions. Word has length 28 [2020-02-10 20:15:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:41,862 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6997 transitions. [2020-02-10 20:15:41,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6997 transitions. [2020-02-10 20:15:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:41,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:41,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:41,864 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:41,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:41,865 INFO L82 PathProgramCache]: Analyzing trace with hash 424017834, now seen corresponding path program 241 times [2020-02-10 20:15:41,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:41,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038819598] [2020-02-10 20:15:41,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:42,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038819598] [2020-02-10 20:15:42,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:42,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:42,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167296355] [2020-02-10 20:15:42,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:42,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:42,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:42,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:42,394 INFO L87 Difference]: Start difference. First operand 1555 states and 6997 transitions. Second operand 11 states. [2020-02-10 20:15:42,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:42,603 INFO L93 Difference]: Finished difference Result 2936 states and 11714 transitions. [2020-02-10 20:15:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:42,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:42,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:42,610 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 20:15:42,610 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:15:42,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:15:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1576. [2020-02-10 20:15:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:15:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7079 transitions. [2020-02-10 20:15:42,695 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7079 transitions. Word has length 28 [2020-02-10 20:15:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:42,695 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7079 transitions. [2020-02-10 20:15:42,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7079 transitions. [2020-02-10 20:15:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:42,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:42,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:42,698 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:42,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1168720332, now seen corresponding path program 242 times [2020-02-10 20:15:42,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:42,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862706152] [2020-02-10 20:15:42,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:43,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862706152] [2020-02-10 20:15:43,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:43,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:43,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288298240] [2020-02-10 20:15:43,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:43,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:43,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:43,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:43,216 INFO L87 Difference]: Start difference. First operand 1576 states and 7079 transitions. Second operand 11 states. [2020-02-10 20:15:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:43,404 INFO L93 Difference]: Finished difference Result 2937 states and 11711 transitions. [2020-02-10 20:15:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:43,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:43,412 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:15:43,412 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:15:43,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:15:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1571. [2020-02-10 20:15:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:15:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7065 transitions. [2020-02-10 20:15:43,477 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7065 transitions. Word has length 28 [2020-02-10 20:15:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:43,477 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7065 transitions. [2020-02-10 20:15:43,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7065 transitions. [2020-02-10 20:15:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:43,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:43,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:43,480 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:43,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2034958792, now seen corresponding path program 243 times [2020-02-10 20:15:43,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:43,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712022839] [2020-02-10 20:15:43,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:44,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712022839] [2020-02-10 20:15:44,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:44,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:44,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599183453] [2020-02-10 20:15:44,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:44,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:44,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:44,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:44,003 INFO L87 Difference]: Start difference. First operand 1571 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:15:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:44,229 INFO L93 Difference]: Finished difference Result 2941 states and 11718 transitions. [2020-02-10 20:15:44,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:44,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:44,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:44,237 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:15:44,237 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:15:44,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:15:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1577. [2020-02-10 20:15:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:15:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7076 transitions. [2020-02-10 20:15:44,301 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7076 transitions. Word has length 28 [2020-02-10 20:15:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:44,301 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7076 transitions. [2020-02-10 20:15:44,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7076 transitions. [2020-02-10 20:15:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:44,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:44,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:44,303 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:44,304 INFO L82 PathProgramCache]: Analyzing trace with hash -770603508, now seen corresponding path program 244 times [2020-02-10 20:15:44,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:44,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756189229] [2020-02-10 20:15:44,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:44,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756189229] [2020-02-10 20:15:44,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:44,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:44,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936304481] [2020-02-10 20:15:44,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:44,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:44,842 INFO L87 Difference]: Start difference. First operand 1577 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:15:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:44,991 INFO L93 Difference]: Finished difference Result 2946 states and 11722 transitions. [2020-02-10 20:15:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:44,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:44,999 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:15:44,999 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:15:45,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:15:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1571. [2020-02-10 20:15:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:15:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7059 transitions. [2020-02-10 20:15:45,062 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7059 transitions. Word has length 28 [2020-02-10 20:15:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:45,063 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7059 transitions. [2020-02-10 20:15:45,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7059 transitions. [2020-02-10 20:15:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:45,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:45,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, 1, 1, 1] [2020-02-10 20:15:45,065 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash 95634952, now seen corresponding path program 245 times [2020-02-10 20:15:45,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:45,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613406588] [2020-02-10 20:15:45,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:45,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613406588] [2020-02-10 20:15:45,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:45,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:45,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502316972] [2020-02-10 20:15:45,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:45,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:45,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:45,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:45,586 INFO L87 Difference]: Start difference. First operand 1571 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:15:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:45,788 INFO L93 Difference]: Finished difference Result 2944 states and 11719 transitions. [2020-02-10 20:15:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:45,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:45,796 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:15:45,796 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:15:45,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:15:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1578. [2020-02-10 20:15:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:15:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7072 transitions. [2020-02-10 20:15:45,860 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7072 transitions. Word has length 28 [2020-02-10 20:15:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:45,860 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7072 transitions. [2020-02-10 20:15:45,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7072 transitions. [2020-02-10 20:15:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:45,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:45,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:45,863 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:45,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:45,863 INFO L82 PathProgramCache]: Analyzing trace with hash 840337450, now seen corresponding path program 246 times [2020-02-10 20:15:45,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:45,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429569516] [2020-02-10 20:15:45,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:46,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429569516] [2020-02-10 20:15:46,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:46,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:46,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747455470] [2020-02-10 20:15:46,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:46,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:46,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:46,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:46,400 INFO L87 Difference]: Start difference. First operand 1578 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:15:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:46,561 INFO L93 Difference]: Finished difference Result 2948 states and 11720 transitions. [2020-02-10 20:15:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:46,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:46,569 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:15:46,569 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 20:15:46,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 20:15:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1565. [2020-02-10 20:15:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:15:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7043 transitions. [2020-02-10 20:15:46,634 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7043 transitions. Word has length 28 [2020-02-10 20:15:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:46,634 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7043 transitions. [2020-02-10 20:15:46,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7043 transitions. [2020-02-10 20:15:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:46,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:46,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:46,637 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:46,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:46,637 INFO L82 PathProgramCache]: Analyzing trace with hash 216894948, now seen corresponding path program 247 times [2020-02-10 20:15:46,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:46,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136826497] [2020-02-10 20:15:46,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:47,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136826497] [2020-02-10 20:15:47,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:47,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:47,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288001136] [2020-02-10 20:15:47,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:47,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:47,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:47,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:47,181 INFO L87 Difference]: Start difference. First operand 1565 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:15:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:47,382 INFO L93 Difference]: Finished difference Result 2923 states and 11678 transitions. [2020-02-10 20:15:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:47,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:47,389 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:15:47,389 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:15:47,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:15:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1574. [2020-02-10 20:15:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:15:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7067 transitions. [2020-02-10 20:15:47,452 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7067 transitions. Word has length 28 [2020-02-10 20:15:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:47,452 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7067 transitions. [2020-02-10 20:15:47,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7067 transitions. [2020-02-10 20:15:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:47,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:47,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:47,456 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:47,456 INFO L82 PathProgramCache]: Analyzing trace with hash 961597446, now seen corresponding path program 248 times [2020-02-10 20:15:47,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:47,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156613559] [2020-02-10 20:15:47,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:47,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156613559] [2020-02-10 20:15:47,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:47,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:47,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438867998] [2020-02-10 20:15:47,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:47,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:47,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:47,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:47,980 INFO L87 Difference]: Start difference. First operand 1574 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:15:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:48,188 INFO L93 Difference]: Finished difference Result 2924 states and 11675 transitions. [2020-02-10 20:15:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:48,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:48,198 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:15:48,198 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:15:48,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:15:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1569. [2020-02-10 20:15:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:15:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7054 transitions. [2020-02-10 20:15:48,276 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7054 transitions. Word has length 28 [2020-02-10 20:15:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:48,276 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7054 transitions. [2020-02-10 20:15:48,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7054 transitions. [2020-02-10 20:15:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:48,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:48,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:48,279 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:48,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:48,280 INFO L82 PathProgramCache]: Analyzing trace with hash -318334854, now seen corresponding path program 249 times [2020-02-10 20:15:48,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:48,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056686864] [2020-02-10 20:15:48,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:48,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056686864] [2020-02-10 20:15:48,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:48,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:48,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140273803] [2020-02-10 20:15:48,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:48,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:48,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:48,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:48,814 INFO L87 Difference]: Start difference. First operand 1569 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:15:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:49,003 INFO L93 Difference]: Finished difference Result 2920 states and 11667 transitions. [2020-02-10 20:15:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:49,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:49,011 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:15:49,011 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:15:49,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:15:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1573. [2020-02-10 20:15:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:15:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7061 transitions. [2020-02-10 20:15:49,075 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7061 transitions. Word has length 28 [2020-02-10 20:15:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:49,076 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7061 transitions. [2020-02-10 20:15:49,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7061 transitions. [2020-02-10 20:15:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:49,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:49,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:49,078 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:49,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:49,078 INFO L82 PathProgramCache]: Analyzing trace with hash -145087162, now seen corresponding path program 250 times [2020-02-10 20:15:49,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:49,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565349406] [2020-02-10 20:15:49,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:49,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565349406] [2020-02-10 20:15:49,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:49,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:49,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256714625] [2020-02-10 20:15:49,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:49,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:49,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:49,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:49,609 INFO L87 Difference]: Start difference. First operand 1573 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:15:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:49,808 INFO L93 Difference]: Finished difference Result 2919 states and 11661 transitions. [2020-02-10 20:15:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:49,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:49,816 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:15:49,816 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:15:49,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:15:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1569. [2020-02-10 20:15:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:15:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7050 transitions. [2020-02-10 20:15:49,880 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7050 transitions. Word has length 28 [2020-02-10 20:15:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:49,880 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7050 transitions. [2020-02-10 20:15:49,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7050 transitions. [2020-02-10 20:15:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:49,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:49,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:49,882 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:49,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:49,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2037308602, now seen corresponding path program 251 times [2020-02-10 20:15:49,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:49,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935644459] [2020-02-10 20:15:49,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:50,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935644459] [2020-02-10 20:15:50,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:50,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:50,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034378764] [2020-02-10 20:15:50,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:50,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:50,415 INFO L87 Difference]: Start difference. First operand 1569 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:15:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:50,681 INFO L93 Difference]: Finished difference Result 2922 states and 11667 transitions. [2020-02-10 20:15:50,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:50,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:50,688 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:15:50,688 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:15:50,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:15:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1573. [2020-02-10 20:15:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:15:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 20:15:50,752 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 20:15:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:50,752 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 20:15:50,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 20:15:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:50,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:50,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, 1, 1, 1] [2020-02-10 20:15:50,755 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:50,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1465853796, now seen corresponding path program 252 times [2020-02-10 20:15:50,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:50,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481046929] [2020-02-10 20:15:50,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:51,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481046929] [2020-02-10 20:15:51,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:51,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:51,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603318734] [2020-02-10 20:15:51,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:51,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:51,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:51,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:51,292 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:15:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:51,524 INFO L93 Difference]: Finished difference Result 2920 states and 11659 transitions. [2020-02-10 20:15:51,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:51,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:51,531 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:15:51,532 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:15:51,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:15:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1565. [2020-02-10 20:15:51,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:15:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7039 transitions. [2020-02-10 20:15:51,596 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7039 transitions. Word has length 28 [2020-02-10 20:15:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:51,596 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7039 transitions. [2020-02-10 20:15:51,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7039 transitions. [2020-02-10 20:15:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:51,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:51,598 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:51,598 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:51,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash 227398052, now seen corresponding path program 253 times [2020-02-10 20:15:51,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:51,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605484865] [2020-02-10 20:15:51,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:52,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605484865] [2020-02-10 20:15:52,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:52,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:52,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882159863] [2020-02-10 20:15:52,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:52,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:52,138 INFO L87 Difference]: Start difference. First operand 1565 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:15:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:52,400 INFO L93 Difference]: Finished difference Result 2935 states and 11697 transitions. [2020-02-10 20:15:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:52,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:52,408 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 20:15:52,408 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:15:52,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:15:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1576. [2020-02-10 20:15:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:15:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7068 transitions. [2020-02-10 20:15:52,472 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7068 transitions. Word has length 28 [2020-02-10 20:15:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:52,472 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7068 transitions. [2020-02-10 20:15:52,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7068 transitions. [2020-02-10 20:15:52,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:52,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:52,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:52,475 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1716803048, now seen corresponding path program 254 times [2020-02-10 20:15:52,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:52,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122533806] [2020-02-10 20:15:52,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:53,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122533806] [2020-02-10 20:15:53,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:53,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:53,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018463807] [2020-02-10 20:15:53,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:53,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:53,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:53,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:53,014 INFO L87 Difference]: Start difference. First operand 1576 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:15:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:53,169 INFO L93 Difference]: Finished difference Result 2940 states and 11701 transitions. [2020-02-10 20:15:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:53,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:53,177 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:15:53,177 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:15:53,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:15:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1570. [2020-02-10 20:15:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:15:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 20:15:53,242 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 20:15:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:53,242 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 20:15:53,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 20:15:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:53,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:53,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:53,244 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:53,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1918772708, now seen corresponding path program 255 times [2020-02-10 20:15:53,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:53,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456703054] [2020-02-10 20:15:53,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:53,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456703054] [2020-02-10 20:15:53,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:53,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:53,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677544330] [2020-02-10 20:15:53,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:53,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:53,771 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:15:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:54,002 INFO L93 Difference]: Finished difference Result 2927 states and 11676 transitions. [2020-02-10 20:15:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:54,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:54,010 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:15:54,010 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:15:54,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:15:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1574. [2020-02-10 20:15:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:15:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7059 transitions. [2020-02-10 20:15:54,074 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7059 transitions. Word has length 28 [2020-02-10 20:15:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:54,074 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7059 transitions. [2020-02-10 20:15:54,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7059 transitions. [2020-02-10 20:15:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:54,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:54,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:54,077 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1745525016, now seen corresponding path program 256 times [2020-02-10 20:15:54,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:54,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320074031] [2020-02-10 20:15:54,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:54,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-02-10 20:15:54,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320074031] [2020-02-10 20:15:54,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:54,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:54,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156132546] [2020-02-10 20:15:54,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:54,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:54,607 INFO L87 Difference]: Start difference. First operand 1574 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:15:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:54,802 INFO L93 Difference]: Finished difference Result 2926 states and 11670 transitions. [2020-02-10 20:15:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:54,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:54,810 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 20:15:54,810 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:15:54,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:15:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1570. [2020-02-10 20:15:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:15:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7048 transitions. [2020-02-10 20:15:54,873 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7048 transitions. Word has length 28 [2020-02-10 20:15:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:54,873 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7048 transitions. [2020-02-10 20:15:54,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7048 transitions. [2020-02-10 20:15:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:54,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:54,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:54,876 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1502453092, now seen corresponding path program 257 times [2020-02-10 20:15:54,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:54,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902229310] [2020-02-10 20:15:54,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:55,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902229310] [2020-02-10 20:15:55,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:55,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:55,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111755015] [2020-02-10 20:15:55,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:55,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:55,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:55,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:55,410 INFO L87 Difference]: Start difference. First operand 1570 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:15:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:55,573 INFO L93 Difference]: Finished difference Result 2938 states and 11692 transitions. [2020-02-10 20:15:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:55,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:55,581 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:15:55,581 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:15:55,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:15:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1575. [2020-02-10 20:15:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:15:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7056 transitions. [2020-02-10 20:15:55,645 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7056 transitions. Word has length 28 [2020-02-10 20:15:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:55,645 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7056 transitions. [2020-02-10 20:15:55,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7056 transitions. [2020-02-10 20:15:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:55,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:55,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:55,648 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:55,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:55,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1476356900, now seen corresponding path program 258 times [2020-02-10 20:15:55,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:55,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631015716] [2020-02-10 20:15:55,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:56,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631015716] [2020-02-10 20:15:56,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:56,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:56,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635187642] [2020-02-10 20:15:56,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:56,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:56,172 INFO L87 Difference]: Start difference. First operand 1575 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:15:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:56,403 INFO L93 Difference]: Finished difference Result 2932 states and 11676 transitions. [2020-02-10 20:15:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:56,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:56,411 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:15:56,411 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:15:56,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:15:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1565. [2020-02-10 20:15:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:15:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7034 transitions. [2020-02-10 20:15:56,474 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7034 transitions. Word has length 28 [2020-02-10 20:15:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:56,474 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7034 transitions. [2020-02-10 20:15:56,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7034 transitions. [2020-02-10 20:15:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:56,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:56,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:56,477 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash 982603654, now seen corresponding path program 259 times [2020-02-10 20:15:56,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:56,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647163437] [2020-02-10 20:15:56,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:57,025 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:15:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:57,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647163437] [2020-02-10 20:15:57,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:57,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:57,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599941858] [2020-02-10 20:15:57,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:57,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:57,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:57,033 INFO L87 Difference]: Start difference. First operand 1565 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:15:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:57,226 INFO L93 Difference]: Finished difference Result 2940 states and 11704 transitions. [2020-02-10 20:15:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:57,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:57,234 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:15:57,234 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:15:57,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:15:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1577. [2020-02-10 20:15:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:15:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7065 transitions. [2020-02-10 20:15:57,297 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7065 transitions. Word has length 28 [2020-02-10 20:15:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:57,298 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7065 transitions. [2020-02-10 20:15:57,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7065 transitions. [2020-02-10 20:15:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:57,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:57,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, 1, 1, 1] [2020-02-10 20:15:57,300 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:57,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:57,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1727306152, now seen corresponding path program 260 times [2020-02-10 20:15:57,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:57,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854208562] [2020-02-10 20:15:57,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:57,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854208562] [2020-02-10 20:15:57,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:57,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:57,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382151622] [2020-02-10 20:15:57,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:57,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:57,829 INFO L87 Difference]: Start difference. First operand 1577 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:15:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:57,980 INFO L93 Difference]: Finished difference Result 2944 states and 11705 transitions. [2020-02-10 20:15:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:57,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:57,987 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:15:57,987 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 20:15:57,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 20:15:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1570. [2020-02-10 20:15:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:15:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7047 transitions. [2020-02-10 20:15:58,051 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7047 transitions. Word has length 28 [2020-02-10 20:15:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:58,051 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7047 transitions. [2020-02-10 20:15:58,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7047 transitions. [2020-02-10 20:15:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:58,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:58,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:58,053 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:58,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:58,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1163567106, now seen corresponding path program 261 times [2020-02-10 20:15:58,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:58,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21494528] [2020-02-10 20:15:58,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:58,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-02-10 20:15:58,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21494528] [2020-02-10 20:15:58,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:58,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:58,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075009390] [2020-02-10 20:15:58,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:58,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:58,573 INFO L87 Difference]: Start difference. First operand 1570 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:15:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:58,751 INFO L93 Difference]: Finished difference Result 2931 states and 11680 transitions. [2020-02-10 20:15:58,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:58,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:58,759 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 20:15:58,759 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 20:15:58,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 20:15:58,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1574. [2020-02-10 20:15:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:15:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 20:15:58,826 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 20:15:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:58,827 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 20:15:58,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 20:15:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:58,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:58,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:58,830 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:58,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:58,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1735021912, now seen corresponding path program 262 times [2020-02-10 20:15:58,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:58,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775486160] [2020-02-10 20:15:58,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:59,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775486160] [2020-02-10 20:15:59,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:59,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:15:59,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823855298] [2020-02-10 20:15:59,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:15:59,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:59,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:15:59,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:59,348 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:15:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:59,530 INFO L93 Difference]: Finished difference Result 2929 states and 11672 transitions. [2020-02-10 20:15:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:15:59,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:15:59,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:59,538 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:15:59,538 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:15:59,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:15:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:15:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1570. [2020-02-10 20:15:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:15:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7043 transitions. [2020-02-10 20:15:59,601 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7043 transitions. Word has length 28 [2020-02-10 20:15:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:59,602 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7043 transitions. [2020-02-10 20:15:59,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:15:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7043 transitions. [2020-02-10 20:15:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:15:59,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:59,604 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:59,604 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:59,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:59,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1192076350, now seen corresponding path program 263 times [2020-02-10 20:15:59,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:59,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736193375] [2020-02-10 20:15:59,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:00,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-02-10 20:16:00,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736193375] [2020-02-10 20:16:00,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:00,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:00,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692905688] [2020-02-10 20:16:00,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:00,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:00,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:00,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:00,124 INFO L87 Difference]: Start difference. First operand 1570 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:16:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:00,283 INFO L93 Difference]: Finished difference Result 2940 states and 11692 transitions. [2020-02-10 20:16:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:00,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:00,291 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:16:00,292 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:16:00,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:16:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1575. [2020-02-10 20:16:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:16:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7051 transitions. [2020-02-10 20:16:00,355 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7051 transitions. Word has length 28 [2020-02-10 20:16:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:00,355 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7051 transitions. [2020-02-10 20:16:00,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7051 transitions. [2020-02-10 20:16:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:00,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:00,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:00,358 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:00,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash -124080954, now seen corresponding path program 264 times [2020-02-10 20:16:00,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:00,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909827380] [2020-02-10 20:16:00,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:00,872 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:16:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:00,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909827380] [2020-02-10 20:16:00,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:00,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:00,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580978526] [2020-02-10 20:16:00,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:00,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:00,879 INFO L87 Difference]: Start difference. First operand 1575 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:16:01,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:01,068 INFO L93 Difference]: Finished difference Result 2934 states and 11676 transitions. [2020-02-10 20:16:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:01,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:01,076 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:16:01,076 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:16:01,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:16:01,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1560. [2020-02-10 20:16:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 20:16:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7020 transitions. [2020-02-10 20:16:01,139 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7020 transitions. Word has length 28 [2020-02-10 20:16:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:01,139 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7020 transitions. [2020-02-10 20:16:01,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7020 transitions. [2020-02-10 20:16:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:01,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:01,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, 1, 1, 1] [2020-02-10 20:16:01,142 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash 155271406, now seen corresponding path program 265 times [2020-02-10 20:16:01,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:01,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366901620] [2020-02-10 20:16:01,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:01,697 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-02-10 20:16:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:01,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366901620] [2020-02-10 20:16:01,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:01,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:01,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404822485] [2020-02-10 20:16:01,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:01,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:01,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:01,705 INFO L87 Difference]: Start difference. First operand 1560 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:16:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:01,886 INFO L93 Difference]: Finished difference Result 2950 states and 11754 transitions. [2020-02-10 20:16:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:01,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:01,893 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:16:01,894 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:16:01,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:16:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1577. [2020-02-10 20:16:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:16:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7079 transitions. [2020-02-10 20:16:01,958 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7079 transitions. Word has length 28 [2020-02-10 20:16:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:01,958 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7079 transitions. [2020-02-10 20:16:01,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7079 transitions. [2020-02-10 20:16:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:01,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:01,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:01,961 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:01,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:01,961 INFO L82 PathProgramCache]: Analyzing trace with hash 899973904, now seen corresponding path program 266 times [2020-02-10 20:16:01,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:01,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905504490] [2020-02-10 20:16:01,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:02,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905504490] [2020-02-10 20:16:02,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:02,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:02,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221124825] [2020-02-10 20:16:02,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:02,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:02,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:02,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:02,487 INFO L87 Difference]: Start difference. First operand 1577 states and 7079 transitions. Second operand 11 states. [2020-02-10 20:16:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:02,691 INFO L93 Difference]: Finished difference Result 2951 states and 11751 transitions. [2020-02-10 20:16:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:02,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:02,698 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:16:02,698 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:16:02,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:16:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1572. [2020-02-10 20:16:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:16:02,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7065 transitions. [2020-02-10 20:16:02,762 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7065 transitions. Word has length 28 [2020-02-10 20:16:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:02,762 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7065 transitions. [2020-02-10 20:16:02,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7065 transitions. [2020-02-10 20:16:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:02,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:02,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:02,765 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:02,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:02,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1766212364, now seen corresponding path program 267 times [2020-02-10 20:16:02,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:02,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127599868] [2020-02-10 20:16:02,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:03,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127599868] [2020-02-10 20:16:03,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:03,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:03,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690943523] [2020-02-10 20:16:03,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:03,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:03,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:03,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:03,292 INFO L87 Difference]: Start difference. First operand 1572 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:16:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:03,498 INFO L93 Difference]: Finished difference Result 2955 states and 11758 transitions. [2020-02-10 20:16:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:03,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:03,505 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:16:03,505 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:16:03,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:16:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1578. [2020-02-10 20:16:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:16:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7076 transitions. [2020-02-10 20:16:03,569 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7076 transitions. Word has length 28 [2020-02-10 20:16:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:03,569 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7076 transitions. [2020-02-10 20:16:03,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7076 transitions. [2020-02-10 20:16:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:03,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:03,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:03,572 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1039349936, now seen corresponding path program 268 times [2020-02-10 20:16:03,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:03,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537501127] [2020-02-10 20:16:03,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:04,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537501127] [2020-02-10 20:16:04,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:04,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:04,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824930560] [2020-02-10 20:16:04,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:04,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:04,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:04,127 INFO L87 Difference]: Start difference. First operand 1578 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:16:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:04,281 INFO L93 Difference]: Finished difference Result 2960 states and 11762 transitions. [2020-02-10 20:16:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:04,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:04,289 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 20:16:04,289 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:16:04,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:16:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1572. [2020-02-10 20:16:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:16:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7059 transitions. [2020-02-10 20:16:04,352 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7059 transitions. Word has length 28 [2020-02-10 20:16:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:04,352 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7059 transitions. [2020-02-10 20:16:04,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7059 transitions. [2020-02-10 20:16:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:04,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:04,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:04,355 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash -173111476, now seen corresponding path program 269 times [2020-02-10 20:16:04,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:04,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686686407] [2020-02-10 20:16:04,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:04,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686686407] [2020-02-10 20:16:04,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:04,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:04,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297936467] [2020-02-10 20:16:04,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:04,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:04,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:04,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:04,892 INFO L87 Difference]: Start difference. First operand 1572 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:16:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:05,085 INFO L93 Difference]: Finished difference Result 2958 states and 11759 transitions. [2020-02-10 20:16:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:05,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:05,092 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:16:05,092 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:16:05,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:16:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1579. [2020-02-10 20:16:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:16:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7072 transitions. [2020-02-10 20:16:05,156 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7072 transitions. Word has length 28 [2020-02-10 20:16:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:05,156 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7072 transitions. [2020-02-10 20:16:05,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7072 transitions. [2020-02-10 20:16:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:05,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:05,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:05,158 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:05,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash 571591022, now seen corresponding path program 270 times [2020-02-10 20:16:05,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:05,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29910119] [2020-02-10 20:16:05,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:05,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29910119] [2020-02-10 20:16:05,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:05,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:05,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743342698] [2020-02-10 20:16:05,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:05,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:05,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:05,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:05,695 INFO L87 Difference]: Start difference. First operand 1579 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:16:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:05,875 INFO L93 Difference]: Finished difference Result 2962 states and 11760 transitions. [2020-02-10 20:16:05,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:05,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:05,883 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:16:05,883 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:16:05,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:16:05,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1566. [2020-02-10 20:16:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:16:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7042 transitions. [2020-02-10 20:16:05,947 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7042 transitions. Word has length 28 [2020-02-10 20:16:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:05,947 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7042 transitions. [2020-02-10 20:16:05,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7042 transitions. [2020-02-10 20:16:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:05,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:05,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:05,949 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:05,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:05,950 INFO L82 PathProgramCache]: Analyzing trace with hash -669941720, now seen corresponding path program 271 times [2020-02-10 20:16:05,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:05,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206414257] [2020-02-10 20:16:05,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:06,503 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-02-10 20:16:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:06,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206414257] [2020-02-10 20:16:06,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:06,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:06,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950449913] [2020-02-10 20:16:06,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:06,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:06,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:06,512 INFO L87 Difference]: Start difference. First operand 1566 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:16:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:06,718 INFO L93 Difference]: Finished difference Result 2944 states and 11736 transitions. [2020-02-10 20:16:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:06,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:06,725 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:16:06,726 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:16:06,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:16:06,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1576. [2020-02-10 20:16:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:16:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7070 transitions. [2020-02-10 20:16:06,789 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7070 transitions. Word has length 28 [2020-02-10 20:16:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:06,790 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7070 transitions. [2020-02-10 20:16:06,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7070 transitions. [2020-02-10 20:16:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:06,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:06,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:06,792 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:06,792 INFO L82 PathProgramCache]: Analyzing trace with hash 74760778, now seen corresponding path program 272 times [2020-02-10 20:16:06,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:06,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245844432] [2020-02-10 20:16:06,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:07,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245844432] [2020-02-10 20:16:07,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:07,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:07,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322632643] [2020-02-10 20:16:07,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:07,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:07,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:07,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:07,323 INFO L87 Difference]: Start difference. First operand 1576 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:16:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:07,506 INFO L93 Difference]: Finished difference Result 2945 states and 11733 transitions. [2020-02-10 20:16:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:07,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:07,513 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:16:07,513 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:16:07,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:16:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1571. [2020-02-10 20:16:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:16:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7056 transitions. [2020-02-10 20:16:07,577 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7056 transitions. Word has length 28 [2020-02-10 20:16:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:07,577 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7056 transitions. [2020-02-10 20:16:07,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7056 transitions. [2020-02-10 20:16:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:07,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:07,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:07,580 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:07,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:07,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2016710394, now seen corresponding path program 273 times [2020-02-10 20:16:07,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:07,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091405959] [2020-02-10 20:16:07,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:08,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091405959] [2020-02-10 20:16:08,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:08,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:08,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123702182] [2020-02-10 20:16:08,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:08,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:08,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:08,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:08,111 INFO L87 Difference]: Start difference. First operand 1571 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:16:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:08,316 INFO L93 Difference]: Finished difference Result 2945 states and 11733 transitions. [2020-02-10 20:16:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:08,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:08,324 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:16:08,324 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:16:08,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:16:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:16:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:16:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7065 transitions. [2020-02-10 20:16:08,388 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7065 transitions. Word has length 28 [2020-02-10 20:16:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:08,388 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7065 transitions. [2020-02-10 20:16:08,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7065 transitions. [2020-02-10 20:16:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:08,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:08,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, 1, 1, 1] [2020-02-10 20:16:08,390 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash -615604214, now seen corresponding path program 274 times [2020-02-10 20:16:08,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:08,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041878645] [2020-02-10 20:16:08,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:08,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041878645] [2020-02-10 20:16:08,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:08,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:08,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249910066] [2020-02-10 20:16:08,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:08,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:08,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:08,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:08,913 INFO L87 Difference]: Start difference. First operand 1576 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:16:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:09,104 INFO L93 Difference]: Finished difference Result 2947 states and 11732 transitions. [2020-02-10 20:16:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:09,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:09,112 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:16:09,112 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:16:09,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:16:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 20:16:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:16:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7051 transitions. [2020-02-10 20:16:09,177 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7051 transitions. Word has length 28 [2020-02-10 20:16:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:09,178 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7051 transitions. [2020-02-10 20:16:09,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7051 transitions. [2020-02-10 20:16:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:09,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16: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, 1, 1, 1] [2020-02-10 20:16:09,180 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash 77386554, now seen corresponding path program 275 times [2020-02-10 20:16:09,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:09,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926114718] [2020-02-10 20:16:09,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:09,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926114718] [2020-02-10 20:16:09,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:09,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:09,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585724723] [2020-02-10 20:16:09,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:09,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:09,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:09,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:09,723 INFO L87 Difference]: Start difference. First operand 1571 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:16:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:09,933 INFO L93 Difference]: Finished difference Result 2948 states and 11735 transitions. [2020-02-10 20:16:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:09,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:09,941 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:16:09,941 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:16:09,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:16:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1577. [2020-02-10 20:16:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:16:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 20:16:10,006 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 20:16:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:10,006 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 20:16:10,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 20:16:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:10,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:10,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:10,009 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 995336744, now seen corresponding path program 276 times [2020-02-10 20:16:10,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:10,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652545712] [2020-02-10 20:16:10,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:10,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652545712] [2020-02-10 20:16:10,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:10,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:10,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941961465] [2020-02-10 20:16:10,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:10,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:10,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:10,547 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:16:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:10,791 INFO L93 Difference]: Finished difference Result 2949 states and 11731 transitions. [2020-02-10 20:16:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:10,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:10,799 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:16:10,799 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:16:10,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:16:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1566. [2020-02-10 20:16:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:16:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7037 transitions. [2020-02-10 20:16:10,864 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7037 transitions. Word has length 28 [2020-02-10 20:16:10,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:10,864 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7037 transitions. [2020-02-10 20:16:10,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7037 transitions. [2020-02-10 20:16:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:10,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:10,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:10,867 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:10,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:10,867 INFO L82 PathProgramCache]: Analyzing trace with hash -659438616, now seen corresponding path program 277 times [2020-02-10 20:16:10,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:10,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993266669] [2020-02-10 20:16:10,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:11,407 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:16:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:11,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993266669] [2020-02-10 20:16:11,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:11,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:11,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527398849] [2020-02-10 20:16:11,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:11,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:11,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:11,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:11,415 INFO L87 Difference]: Start difference. First operand 1566 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:16:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:11,613 INFO L93 Difference]: Finished difference Result 2957 states and 11757 transitions. [2020-02-10 20:16:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:11,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:11,621 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:16:11,621 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:16:11,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:16:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1578. [2020-02-10 20:16:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:16:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7070 transitions. [2020-02-10 20:16:11,690 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7070 transitions. Word has length 28 [2020-02-10 20:16:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:11,690 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7070 transitions. [2020-02-10 20:16:11,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7070 transitions. [2020-02-10 20:16:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:11,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:11,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:11,692 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:11,692 INFO L82 PathProgramCache]: Analyzing trace with hash 829966380, now seen corresponding path program 278 times [2020-02-10 20:16:11,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:11,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280055505] [2020-02-10 20:16:11,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:12,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280055505] [2020-02-10 20:16:12,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:12,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:12,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402135842] [2020-02-10 20:16:12,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:12,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:12,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:12,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:12,215 INFO L87 Difference]: Start difference. First operand 1578 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:16:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:12,415 INFO L93 Difference]: Finished difference Result 2962 states and 11761 transitions. [2020-02-10 20:16:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:12,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:12,422 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:16:12,422 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:16:12,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:16:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1572. [2020-02-10 20:16:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:16:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7053 transitions. [2020-02-10 20:16:12,487 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7053 transitions. Word has length 28 [2020-02-10 20:16:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:12,487 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7053 transitions. [2020-02-10 20:16:12,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7053 transitions. [2020-02-10 20:16:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:12,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:12,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:12,489 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:12,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:12,490 INFO L82 PathProgramCache]: Analyzing trace with hash 416272540, now seen corresponding path program 279 times [2020-02-10 20:16:12,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:12,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012413464] [2020-02-10 20:16:12,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:13,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012413464] [2020-02-10 20:16:13,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:13,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:13,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331931074] [2020-02-10 20:16:13,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:13,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:13,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:13,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:13,010 INFO L87 Difference]: Start difference. First operand 1572 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:16:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:13,201 INFO L93 Difference]: Finished difference Result 2953 states and 11744 transitions. [2020-02-10 20:16:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:13,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:13,209 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:16:13,209 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:16:13,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:16:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 20:16:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:16:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 20:16:13,275 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 20:16:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:13,275 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 20:16:13,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 20:16:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:13,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:13,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:13,278 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:13,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2078925228, now seen corresponding path program 280 times [2020-02-10 20:16:13,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:13,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610905491] [2020-02-10 20:16:13,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:13,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610905491] [2020-02-10 20:16:13,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:13,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:13,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991382507] [2020-02-10 20:16:13,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:13,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:13,801 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:16:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:14,028 INFO L93 Difference]: Finished difference Result 2955 states and 11743 transitions. [2020-02-10 20:16:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:14,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:14,036 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:16:14,036 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:16:14,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:16:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 20:16:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:16:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7048 transitions. [2020-02-10 20:16:14,100 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7048 transitions. Word has length 28 [2020-02-10 20:16:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:14,101 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7048 transitions. [2020-02-10 20:16:14,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7048 transitions. [2020-02-10 20:16:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:14,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:14,103 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:14,103 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash 832592156, now seen corresponding path program 281 times [2020-02-10 20:16:14,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:14,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25107131] [2020-02-10 20:16:14,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:14,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25107131] [2020-02-10 20:16:14,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:14,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:14,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110544394] [2020-02-10 20:16:14,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:14,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:14,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:14,629 INFO L87 Difference]: Start difference. First operand 1572 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:16:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:14,818 INFO L93 Difference]: Finished difference Result 2966 states and 11765 transitions. [2020-02-10 20:16:14,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:14,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:14,826 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:16:14,826 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:16:14,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:16:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1580. [2020-02-10 20:16:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:16:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7062 transitions. [2020-02-10 20:16:14,891 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7062 transitions. Word has length 28 [2020-02-10 20:16:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:14,891 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7062 transitions. [2020-02-10 20:16:14,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7062 transitions. [2020-02-10 20:16:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:14,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:14,893 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:14,893 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1005839848, now seen corresponding path program 282 times [2020-02-10 20:16:14,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:14,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484738172] [2020-02-10 20:16:14,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:15,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484738172] [2020-02-10 20:16:15,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:15,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:15,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387800685] [2020-02-10 20:16:15,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:15,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:15,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:15,426 INFO L87 Difference]: Start difference. First operand 1580 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:16:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:15,602 INFO L93 Difference]: Finished difference Result 2963 states and 11752 transitions. [2020-02-10 20:16:15,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:15,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:15,609 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:16:15,609 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:16:15,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:16:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1566. [2020-02-10 20:16:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:16:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7031 transitions. [2020-02-10 20:16:15,674 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7031 transitions. Word has length 28 [2020-02-10 20:16:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:15,674 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7031 transitions. [2020-02-10 20:16:15,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7031 transitions. [2020-02-10 20:16:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:15,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16: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, 1, 1, 1] [2020-02-10 20:16:15,677 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash 95766986, now seen corresponding path program 283 times [2020-02-10 20:16:15,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:15,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869420230] [2020-02-10 20:16:15,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:16,219 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:16:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:16,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869420230] [2020-02-10 20:16:16,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:16,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:16,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513316232] [2020-02-10 20:16:16,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:16,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:16,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:16,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:16,227 INFO L87 Difference]: Start difference. First operand 1566 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:16:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:16,425 INFO L93 Difference]: Finished difference Result 2964 states and 11770 transitions. [2020-02-10 20:16:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:16,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:16,432 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:16:16,432 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:16:16,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:16:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1580. [2020-02-10 20:16:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:16:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7070 transitions. [2020-02-10 20:16:16,497 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7070 transitions. Word has length 28 [2020-02-10 20:16:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:16,497 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7070 transitions. [2020-02-10 20:16:16,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7070 transitions. [2020-02-10 20:16:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:16,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:16,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:16,500 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash 840469484, now seen corresponding path program 284 times [2020-02-10 20:16:16,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:16,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716908879] [2020-02-10 20:16:16,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:17,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716908879] [2020-02-10 20:16:17,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:17,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:17,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690015075] [2020-02-10 20:16:17,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:17,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:17,037 INFO L87 Difference]: Start difference. First operand 1580 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:16:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:17,225 INFO L93 Difference]: Finished difference Result 2968 states and 11771 transitions. [2020-02-10 20:16:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:17,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:17,233 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:16:17,233 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:16:17,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:16:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1573. [2020-02-10 20:16:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:16:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7050 transitions. [2020-02-10 20:16:17,297 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7050 transitions. Word has length 28 [2020-02-10 20:16:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:17,297 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7050 transitions. [2020-02-10 20:16:17,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7050 transitions. [2020-02-10 20:16:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:17,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:17,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, 1, 1, 1] [2020-02-10 20:16:17,300 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1171478142, now seen corresponding path program 285 times [2020-02-10 20:16:17,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:17,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124137532] [2020-02-10 20:16:17,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:17,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124137532] [2020-02-10 20:16:17,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:17,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:17,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493698774] [2020-02-10 20:16:17,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:17,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:17,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:17,828 INFO L87 Difference]: Start difference. First operand 1573 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:16:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:18,031 INFO L93 Difference]: Finished difference Result 2960 states and 11756 transitions. [2020-02-10 20:16:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:18,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:18,039 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 20:16:18,039 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:16:18,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:16:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1579. [2020-02-10 20:16:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:16:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7061 transitions. [2020-02-10 20:16:18,110 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7061 transitions. Word has length 28 [2020-02-10 20:16:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:18,110 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7061 transitions. [2020-02-10 20:16:18,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7061 transitions. [2020-02-10 20:16:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:18,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:18,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:18,113 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:18,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2089428332, now seen corresponding path program 286 times [2020-02-10 20:16:18,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:18,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768134409] [2020-02-10 20:16:18,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:18,641 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:16: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-02-10 20:16:18,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768134409] [2020-02-10 20:16:18,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:18,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:18,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068602750] [2020-02-10 20:16:18,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:18,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:18,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:18,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:18,649 INFO L87 Difference]: Start difference. First operand 1579 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:16:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:18,880 INFO L93 Difference]: Finished difference Result 2961 states and 11752 transitions. [2020-02-10 20:16:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:18,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:18,887 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:16:18,887 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:16:18,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:18,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:16:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1573. [2020-02-10 20:16:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:16:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 20:16:18,953 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 20:16:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:18,953 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 20:16:18,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 20:16:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:18,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:18,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:18,957 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:18,957 INFO L82 PathProgramCache]: Analyzing trace with hash -767845698, now seen corresponding path program 287 times [2020-02-10 20:16:18,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:18,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738133747] [2020-02-10 20:16:18,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:19,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738133747] [2020-02-10 20:16:19,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:19,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:19,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940120594] [2020-02-10 20:16:19,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:19,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:19,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:19,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:19,509 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:16:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:19,654 INFO L93 Difference]: Finished difference Result 2970 states and 11769 transitions. [2020-02-10 20:16:19,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:19,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:19,662 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:16:19,662 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:16:19,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:16:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1581. [2020-02-10 20:16:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:16:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7058 transitions. [2020-02-10 20:16:19,725 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7058 transitions. Word has length 28 [2020-02-10 20:16:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:19,725 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7058 transitions. [2020-02-10 20:16:19,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7058 transitions. [2020-02-10 20:16:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:19,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:19,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:19,728 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash -594598006, now seen corresponding path program 288 times [2020-02-10 20:16:19,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:19,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789569071] [2020-02-10 20:16:19,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:20,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789569071] [2020-02-10 20:16:20,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:20,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:20,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10158666] [2020-02-10 20:16:20,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:20,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:20,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:20,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:20,259 INFO L87 Difference]: Start difference. First operand 1581 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:16:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:20,440 INFO L93 Difference]: Finished difference Result 2967 states and 11756 transitions. [2020-02-10 20:16:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:20,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:20,448 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:16:20,448 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:16:20,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:16:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1560. [2020-02-10 20:16:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 20:16:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7015 transitions. [2020-02-10 20:16:20,512 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7015 transitions. Word has length 28 [2020-02-10 20:16:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:20,512 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7015 transitions. [2020-02-10 20:16:20,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7015 transitions. [2020-02-10 20:16:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:20,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:20,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:20,514 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash 405091818, now seen corresponding path program 289 times [2020-02-10 20:16:20,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:20,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18245506] [2020-02-10 20:16:20,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:21,056 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-02-10 20:16:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:21,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18245506] [2020-02-10 20:16:21,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:21,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:21,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927107699] [2020-02-10 20:16:21,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:21,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:21,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:21,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:21,064 INFO L87 Difference]: Start difference. First operand 1560 states and 7015 transitions. Second operand 11 states. [2020-02-10 20:16:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:21,283 INFO L93 Difference]: Finished difference Result 2913 states and 11649 transitions. [2020-02-10 20:16:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:21,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:21,290 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 20:16:21,290 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:16:21,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:16:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1573. [2020-02-10 20:16:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:16:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7058 transitions. [2020-02-10 20:16:21,353 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7058 transitions. Word has length 28 [2020-02-10 20:16:21,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:21,354 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7058 transitions. [2020-02-10 20:16:21,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7058 transitions. [2020-02-10 20:16:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:21,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:21,356 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:21,356 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:21,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1149794316, now seen corresponding path program 290 times [2020-02-10 20:16:21,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:21,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466639512] [2020-02-10 20:16:21,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:21,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466639512] [2020-02-10 20:16:21,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:21,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:21,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477215544] [2020-02-10 20:16:21,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:21,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:21,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:21,883 INFO L87 Difference]: Start difference. First operand 1573 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:16:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:22,090 INFO L93 Difference]: Finished difference Result 2914 states and 11646 transitions. [2020-02-10 20:16:22,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:22,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:22,097 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:16:22,097 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 20:16:22,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 20:16:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1568. [2020-02-10 20:16:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:16:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7045 transitions. [2020-02-10 20:16:22,160 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7045 transitions. Word has length 28 [2020-02-10 20:16:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:22,161 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7045 transitions. [2020-02-10 20:16:22,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7045 transitions. [2020-02-10 20:16:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:22,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:22,163 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:22,163 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:22,163 INFO L82 PathProgramCache]: Analyzing trace with hash -130137984, now seen corresponding path program 291 times [2020-02-10 20:16:22,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:22,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416822069] [2020-02-10 20:16:22,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:22,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416822069] [2020-02-10 20:16:22,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:22,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:22,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777034326] [2020-02-10 20:16:22,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:22,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:22,692 INFO L87 Difference]: Start difference. First operand 1568 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:16:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:22,918 INFO L93 Difference]: Finished difference Result 2910 states and 11638 transitions. [2020-02-10 20:16:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:22,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:22,926 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:16:22,926 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:16:22,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:16:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1572. [2020-02-10 20:16:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:16:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7052 transitions. [2020-02-10 20:16:22,990 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7052 transitions. Word has length 28 [2020-02-10 20:16:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:22,990 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7052 transitions. [2020-02-10 20:16:22,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7052 transitions. [2020-02-10 20:16:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:22,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:22,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:22,993 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:22,993 INFO L82 PathProgramCache]: Analyzing trace with hash 43109708, now seen corresponding path program 292 times [2020-02-10 20:16:22,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:22,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401924903] [2020-02-10 20:16:22,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:23,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401924903] [2020-02-10 20:16:23,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:23,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:23,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072670215] [2020-02-10 20:16:23,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:23,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:23,530 INFO L87 Difference]: Start difference. First operand 1572 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:16:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:23,744 INFO L93 Difference]: Finished difference Result 2909 states and 11632 transitions. [2020-02-10 20:16:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:23,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:23,752 INFO L225 Difference]: With dead ends: 2909 [2020-02-10 20:16:23,752 INFO L226 Difference]: Without dead ends: 2891 [2020-02-10 20:16:23,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2020-02-10 20:16:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 1568. [2020-02-10 20:16:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:16:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7041 transitions. [2020-02-10 20:16:23,824 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7041 transitions. Word has length 28 [2020-02-10 20:16:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:23,825 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7041 transitions. [2020-02-10 20:16:23,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7041 transitions. [2020-02-10 20:16:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:23,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:23,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:23,827 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:23,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2069461824, now seen corresponding path program 293 times [2020-02-10 20:16:23,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:23,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886838514] [2020-02-10 20:16:23,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:24,346 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:16:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:24,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886838514] [2020-02-10 20:16:24,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:24,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:24,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406316257] [2020-02-10 20:16:24,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:24,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:24,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:24,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:24,354 INFO L87 Difference]: Start difference. First operand 1568 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:16:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:24,615 INFO L93 Difference]: Finished difference Result 2912 states and 11638 transitions. [2020-02-10 20:16:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:24,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:24,622 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:16:24,623 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:16:24,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:16:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1572. [2020-02-10 20:16:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:16:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7048 transitions. [2020-02-10 20:16:24,686 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7048 transitions. Word has length 28 [2020-02-10 20:16:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:24,686 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7048 transitions. [2020-02-10 20:16:24,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7048 transitions. [2020-02-10 20:16:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:24,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:24,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:24,689 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:24,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:24,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1654050666, now seen corresponding path program 294 times [2020-02-10 20:16:24,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:24,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705585701] [2020-02-10 20:16:24,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:25,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705585701] [2020-02-10 20:16:25,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:25,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:25,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856998556] [2020-02-10 20:16:25,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:25,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:25,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:25,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:25,216 INFO L87 Difference]: Start difference. First operand 1572 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:16:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:25,450 INFO L93 Difference]: Finished difference Result 2910 states and 11630 transitions. [2020-02-10 20:16:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:25,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:25,457 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:16:25,458 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:16:25,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:16:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1564. [2020-02-10 20:16:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:16:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7030 transitions. [2020-02-10 20:16:25,521 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7030 transitions. Word has length 28 [2020-02-10 20:16:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:25,521 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7030 transitions. [2020-02-10 20:16:25,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7030 transitions. [2020-02-10 20:16:25,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:25,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:25,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:25,523 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:25,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:25,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1499183406, now seen corresponding path program 295 times [2020-02-10 20:16:25,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:25,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085620484] [2020-02-10 20:16:25,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:25,961 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:16:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:26,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085620484] [2020-02-10 20:16:26,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:26,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:26,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361563640] [2020-02-10 20:16:26,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:26,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:26,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:26,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:26,077 INFO L87 Difference]: Start difference. First operand 1564 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:16:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:26,264 INFO L93 Difference]: Finished difference Result 2920 states and 11664 transitions. [2020-02-10 20:16:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:26,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:26,272 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:16:26,272 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:16:26,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:16:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1574. [2020-02-10 20:16:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:16:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7058 transitions. [2020-02-10 20:16:26,336 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7058 transitions. Word has length 28 [2020-02-10 20:16:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:26,336 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7058 transitions. [2020-02-10 20:16:26,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7058 transitions. [2020-02-10 20:16:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:26,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:26,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:26,339 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:26,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:26,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2051081392, now seen corresponding path program 296 times [2020-02-10 20:16:26,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:26,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922640529] [2020-02-10 20:16:26,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:26,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922640529] [2020-02-10 20:16:26,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:26,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:26,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192152810] [2020-02-10 20:16:26,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:26,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:26,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:26,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:26,859 INFO L87 Difference]: Start difference. First operand 1574 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:16:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:27,059 INFO L93 Difference]: Finished difference Result 2921 states and 11661 transitions. [2020-02-10 20:16:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:27,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:27,067 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:16:27,068 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:16:27,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:16:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1569. [2020-02-10 20:16:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:16:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7044 transitions. [2020-02-10 20:16:27,131 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7044 transitions. Word has length 28 [2020-02-10 20:16:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:27,131 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7044 transitions. [2020-02-10 20:16:27,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7044 transitions. [2020-02-10 20:16:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:27,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:27,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:27,134 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash -109131776, now seen corresponding path program 297 times [2020-02-10 20:16:27,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:27,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760561555] [2020-02-10 20:16:27,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:27,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760561555] [2020-02-10 20:16:27,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:27,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:27,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247923557] [2020-02-10 20:16:27,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:27,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:27,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:27,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:27,661 INFO L87 Difference]: Start difference. First operand 1569 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:16:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:27,927 INFO L93 Difference]: Finished difference Result 2921 states and 11661 transitions. [2020-02-10 20:16:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:27,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:27,935 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:16:27,935 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:16:27,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:16:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1574. [2020-02-10 20:16:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:16:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7053 transitions. [2020-02-10 20:16:28,004 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7053 transitions. Word has length 28 [2020-02-10 20:16:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:28,005 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7053 transitions. [2020-02-10 20:16:28,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7053 transitions. [2020-02-10 20:16:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:28,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:28,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:28,008 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1553520912, now seen corresponding path program 298 times [2020-02-10 20:16:28,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:28,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080473917] [2020-02-10 20:16:28,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:28,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080473917] [2020-02-10 20:16:28,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:28,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:28,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987909317] [2020-02-10 20:16:28,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:28,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:28,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:28,538 INFO L87 Difference]: Start difference. First operand 1574 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:16:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:28,799 INFO L93 Difference]: Finished difference Result 2923 states and 11660 transitions. [2020-02-10 20:16:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:28,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:28,806 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:16:28,806 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:16:28,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:16:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1569. [2020-02-10 20:16:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:16:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7039 transitions. [2020-02-10 20:16:28,871 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7039 transitions. Word has length 28 [2020-02-10 20:16:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:28,871 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7039 transitions. [2020-02-10 20:16:28,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7039 transitions. [2020-02-10 20:16:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:28,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:28,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:28,873 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:28,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2048455616, now seen corresponding path program 299 times [2020-02-10 20:16:28,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:28,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804301839] [2020-02-10 20:16:28,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:29,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804301839] [2020-02-10 20:16:29,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:29,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:29,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520564698] [2020-02-10 20:16:29,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:29,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:29,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:29,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:29,406 INFO L87 Difference]: Start difference. First operand 1569 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:16:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:29,667 INFO L93 Difference]: Finished difference Result 2924 states and 11663 transitions. [2020-02-10 20:16:29,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:29,667 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:29,675 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:16:29,675 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:16:29,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:16:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1575. [2020-02-10 20:16:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:16:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7050 transitions. [2020-02-10 20:16:29,738 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7050 transitions. Word has length 28 [2020-02-10 20:16:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:29,738 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7050 transitions. [2020-02-10 20:16:29,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7050 transitions. [2020-02-10 20:16:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:29,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:29,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, 1, 1, 1] [2020-02-10 20:16:29,741 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:29,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:29,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1130505426, now seen corresponding path program 300 times [2020-02-10 20:16:29,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:29,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555887562] [2020-02-10 20:16:29,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:30,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555887562] [2020-02-10 20:16:30,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:30,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:30,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232360306] [2020-02-10 20:16:30,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:30,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:30,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:30,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:30,275 INFO L87 Difference]: Start difference. First operand 1575 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:16:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:30,538 INFO L93 Difference]: Finished difference Result 2925 states and 11659 transitions. [2020-02-10 20:16:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:30,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:30,546 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:16:30,546 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 20:16:30,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 20:16:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1564. [2020-02-10 20:16:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:16:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7026 transitions. [2020-02-10 20:16:30,610 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7026 transitions. Word has length 28 [2020-02-10 20:16:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:30,610 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7026 transitions. [2020-02-10 20:16:30,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7026 transitions. [2020-02-10 20:16:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:30,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:30,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:30,613 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:30,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:30,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1551698926, now seen corresponding path program 301 times [2020-02-10 20:16:30,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:30,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940986682] [2020-02-10 20:16:30,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:31,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940986682] [2020-02-10 20:16:31,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:31,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:31,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646412755] [2020-02-10 20:16:31,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:31,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:31,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:31,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:31,157 INFO L87 Difference]: Start difference. First operand 1564 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:16:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:31,368 INFO L93 Difference]: Finished difference Result 2911 states and 11636 transitions. [2020-02-10 20:16:31,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:31,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:31,375 INFO L225 Difference]: With dead ends: 2911 [2020-02-10 20:16:31,375 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:16:31,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:16:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1572. [2020-02-10 20:16:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:16:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7048 transitions. [2020-02-10 20:16:31,440 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7048 transitions. Word has length 28 [2020-02-10 20:16:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:31,441 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7048 transitions. [2020-02-10 20:16:31,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7048 transitions. [2020-02-10 20:16:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:31,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:31,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:31,443 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1724946618, now seen corresponding path program 302 times [2020-02-10 20:16:31,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:31,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494124381] [2020-02-10 20:16:31,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:31,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494124381] [2020-02-10 20:16:31,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:31,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:31,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340389995] [2020-02-10 20:16:31,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:31,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:31,958 INFO L87 Difference]: Start difference. First operand 1572 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:16:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:32,172 INFO L93 Difference]: Finished difference Result 2910 states and 11630 transitions. [2020-02-10 20:16:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:32,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:32,179 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:16:32,179 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 20:16:32,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 20:16:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1568. [2020-02-10 20:16:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:16:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7037 transitions. [2020-02-10 20:16:32,243 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7037 transitions. Word has length 28 [2020-02-10 20:16:32,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:32,243 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7037 transitions. [2020-02-10 20:16:32,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7037 transitions. [2020-02-10 20:16:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:32,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:32,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:32,246 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:32,246 INFO L82 PathProgramCache]: Analyzing trace with hash 478613546, now seen corresponding path program 303 times [2020-02-10 20:16:32,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:32,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578840814] [2020-02-10 20:16:32,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:32,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578840814] [2020-02-10 20:16:32,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:32,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:32,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223669024] [2020-02-10 20:16:32,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:32,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:32,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:32,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:32,769 INFO L87 Difference]: Start difference. First operand 1568 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:16:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:32,974 INFO L93 Difference]: Finished difference Result 2915 states and 11641 transitions. [2020-02-10 20:16:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:32,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:32,982 INFO L225 Difference]: With dead ends: 2915 [2020-02-10 20:16:32,982 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:16:32,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:16:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1573. [2020-02-10 20:16:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:16:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7046 transitions. [2020-02-10 20:16:33,045 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7046 transitions. Word has length 28 [2020-02-10 20:16:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:33,045 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7046 transitions. [2020-02-10 20:16:33,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7046 transitions. [2020-02-10 20:16:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:33,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:33,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:33,048 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:33,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2141266234, now seen corresponding path program 304 times [2020-02-10 20:16:33,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:33,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056089014] [2020-02-10 20:16:33,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:33,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-02-10 20:16:33,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056089014] [2020-02-10 20:16:33,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:33,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:33,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439067847] [2020-02-10 20:16:33,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:33,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:33,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:33,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:33,573 INFO L87 Difference]: Start difference. First operand 1573 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:16:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:33,750 INFO L93 Difference]: Finished difference Result 2917 states and 11640 transitions. [2020-02-10 20:16:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:33,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:33,758 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:16:33,758 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:16:33,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:33,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:16:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1568. [2020-02-10 20:16:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:16:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7033 transitions. [2020-02-10 20:16:33,822 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7033 transitions. Word has length 28 [2020-02-10 20:16:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:33,822 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7033 transitions. [2020-02-10 20:16:33,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7033 transitions. [2020-02-10 20:16:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:33,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:33,825 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:33,825 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1727572394, now seen corresponding path program 305 times [2020-02-10 20:16:33,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:33,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761122635] [2020-02-10 20:16:33,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:34,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761122635] [2020-02-10 20:16:34,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:34,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:34,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377280441] [2020-02-10 20:16:34,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:34,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:34,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:34,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:34,342 INFO L87 Difference]: Start difference. First operand 1568 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:16:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:34,506 INFO L93 Difference]: Finished difference Result 2912 states and 11630 transitions. [2020-02-10 20:16:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:34,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:34,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:34,514 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:16:34,514 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:16:34,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:16:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1572. [2020-02-10 20:16:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:16:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7040 transitions. [2020-02-10 20:16:34,577 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7040 transitions. Word has length 28 [2020-02-10 20:16:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:34,578 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7040 transitions. [2020-02-10 20:16:34,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7040 transitions. [2020-02-10 20:16:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:34,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:34,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:34,580 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1077989906, now seen corresponding path program 306 times [2020-02-10 20:16:34,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:34,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287086053] [2020-02-10 20:16:34,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:35,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287086053] [2020-02-10 20:16:35,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:35,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:35,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644708087] [2020-02-10 20:16:35,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:35,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:35,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:35,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:35,103 INFO L87 Difference]: Start difference. First operand 1572 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:16:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:35,299 INFO L93 Difference]: Finished difference Result 2915 states and 11632 transitions. [2020-02-10 20:16:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:35,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:35,306 INFO L225 Difference]: With dead ends: 2915 [2020-02-10 20:16:35,306 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:16:35,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:16:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1564. [2020-02-10 20:16:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:16:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7022 transitions. [2020-02-10 20:16:35,370 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7022 transitions. Word has length 28 [2020-02-10 20:16:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:35,370 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7022 transitions. [2020-02-10 20:16:35,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7022 transitions. [2020-02-10 20:16:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:35,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:35,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:35,372 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1988062768, now seen corresponding path program 307 times [2020-02-10 20:16:35,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:35,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490090897] [2020-02-10 20:16:35,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:35,801 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:16:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:35,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490090897] [2020-02-10 20:16:35,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:35,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:35,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382357188] [2020-02-10 20:16:35,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:35,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:35,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:35,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:35,922 INFO L87 Difference]: Start difference. First operand 1564 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:16:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:36,086 INFO L93 Difference]: Finished difference Result 2915 states and 11641 transitions. [2020-02-10 20:16:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:36,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:36,094 INFO L225 Difference]: With dead ends: 2915 [2020-02-10 20:16:36,094 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:16:36,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:16:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1572. [2020-02-10 20:16:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:16:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7044 transitions. [2020-02-10 20:16:36,158 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7044 transitions. Word has length 28 [2020-02-10 20:16:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:36,158 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7044 transitions. [2020-02-10 20:16:36,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7044 transitions. [2020-02-10 20:16:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:36,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:36,160 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:36,160 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:36,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1735449722, now seen corresponding path program 308 times [2020-02-10 20:16:36,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:36,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897745452] [2020-02-10 20:16:36,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:36,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897745452] [2020-02-10 20:16:36,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:36,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:36,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38053441] [2020-02-10 20:16:36,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:36,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:36,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:36,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:36,676 INFO L87 Difference]: Start difference. First operand 1572 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:16:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:36,869 INFO L93 Difference]: Finished difference Result 2913 states and 11633 transitions. [2020-02-10 20:16:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:36,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:36,877 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 20:16:36,877 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:16:36,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:16:36,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1568. [2020-02-10 20:16:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:16:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7033 transitions. [2020-02-10 20:16:36,940 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7033 transitions. Word has length 28 [2020-02-10 20:16:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:36,940 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7033 transitions. [2020-02-10 20:16:36,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7033 transitions. [2020-02-10 20:16:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:36,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:36,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:36,943 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1233819148, now seen corresponding path program 309 times [2020-02-10 20:16:36,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:36,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222909788] [2020-02-10 20:16:36,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:37,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222909788] [2020-02-10 20:16:37,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:37,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:37,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307635399] [2020-02-10 20:16:37,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:37,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:37,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:37,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:37,472 INFO L87 Difference]: Start difference. First operand 1568 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:16:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:37,644 INFO L93 Difference]: Finished difference Result 2920 states and 11649 transitions. [2020-02-10 20:16:37,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:37,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:37,653 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:16:37,653 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:16:37,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:16:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1574. [2020-02-10 20:16:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:16:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7044 transitions. [2020-02-10 20:16:37,722 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7044 transitions. Word has length 28 [2020-02-10 20:16:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:37,722 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7044 transitions. [2020-02-10 20:16:37,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7044 transitions. [2020-02-10 20:16:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:37,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:37,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:37,725 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:37,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:37,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2143197958, now seen corresponding path program 310 times [2020-02-10 20:16:37,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:37,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633037969] [2020-02-10 20:16:37,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:38,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633037969] [2020-02-10 20:16:38,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:38,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:38,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358959515] [2020-02-10 20:16:38,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:38,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:38,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:38,293 INFO L87 Difference]: Start difference. First operand 1574 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:16:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:38,501 INFO L93 Difference]: Finished difference Result 2921 states and 11645 transitions. [2020-02-10 20:16:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:38,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:38,509 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:16:38,509 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:16:38,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:16:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1568. [2020-02-10 20:16:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:16:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7029 transitions. [2020-02-10 20:16:38,572 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7029 transitions. Word has length 28 [2020-02-10 20:16:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:38,572 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7029 transitions. [2020-02-10 20:16:38,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7029 transitions. [2020-02-10 20:16:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:38,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:38,574 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:38,574 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash 127134540, now seen corresponding path program 311 times [2020-02-10 20:16:38,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:38,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706526552] [2020-02-10 20:16:38,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:39,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706526552] [2020-02-10 20:16:39,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:39,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:39,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210120787] [2020-02-10 20:16:39,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:39,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:39,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:39,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:39,114 INFO L87 Difference]: Start difference. First operand 1568 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:16:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:39,284 INFO L93 Difference]: Finished difference Result 2914 states and 11631 transitions. [2020-02-10 20:16:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:39,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:39,291 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:16:39,292 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:16:39,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:39,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:16:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1572. [2020-02-10 20:16:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:16:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7036 transitions. [2020-02-10 20:16:39,355 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7036 transitions. Word has length 28 [2020-02-10 20:16:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:39,355 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7036 transitions. [2020-02-10 20:16:39,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7036 transitions. [2020-02-10 20:16:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:39,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:39,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:39,357 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:39,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1616539536, now seen corresponding path program 312 times [2020-02-10 20:16:39,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:39,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623367676] [2020-02-10 20:16:39,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:39,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623367676] [2020-02-10 20:16:39,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:39,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:39,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933431387] [2020-02-10 20:16:39,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:39,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:39,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:39,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:39,886 INFO L87 Difference]: Start difference. First operand 1572 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:16:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:40,057 INFO L93 Difference]: Finished difference Result 2917 states and 11633 transitions. [2020-02-10 20:16:40,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:40,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:40,065 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:16:40,065 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:16:40,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:16:40,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1560. [2020-02-10 20:16:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 20:16:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7011 transitions. [2020-02-10 20:16:40,128 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7011 transitions. Word has length 28 [2020-02-10 20:16:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:40,128 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7011 transitions. [2020-02-10 20:16:40,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7011 transitions. [2020-02-10 20:16:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:40,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:40,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:40,130 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:40,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1953338296, now seen corresponding path program 313 times [2020-02-10 20:16:40,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:40,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474129790] [2020-02-10 20:16:40,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:40,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474129790] [2020-02-10 20:16:40,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:40,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:40,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452126295] [2020-02-10 20:16:40,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:40,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:40,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:40,670 INFO L87 Difference]: Start difference. First operand 1560 states and 7011 transitions. Second operand 11 states. [2020-02-10 20:16:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:40,837 INFO L93 Difference]: Finished difference Result 2937 states and 11697 transitions. [2020-02-10 20:16:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:40,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:40,845 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:16:40,846 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 20:16:40,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 20:16:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1576. [2020-02-10 20:16:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:16:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 20:16:40,911 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 20:16:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:40,911 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 20:16:40,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 20:16:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:40,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:40,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:40,913 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash -463933300, now seen corresponding path program 314 times [2020-02-10 20:16:40,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:40,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365169300] [2020-02-10 20:16:40,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:41,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365169300] [2020-02-10 20:16:41,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:41,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:41,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059386149] [2020-02-10 20:16:41,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:41,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:41,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:41,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:41,435 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:16:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:41,579 INFO L93 Difference]: Finished difference Result 2942 states and 11701 transitions. [2020-02-10 20:16:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:41,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:41,587 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:16:41,587 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:16:41,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:16:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1570. [2020-02-10 20:16:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:16:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7047 transitions. [2020-02-10 20:16:41,653 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7047 transitions. Word has length 28 [2020-02-10 20:16:41,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:41,653 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7047 transitions. [2020-02-10 20:16:41,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7047 transitions. [2020-02-10 20:16:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:41,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:41,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:41,655 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash 195458240, now seen corresponding path program 315 times [2020-02-10 20:16:41,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:41,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451664419] [2020-02-10 20:16:41,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:42,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451664419] [2020-02-10 20:16:42,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:42,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:42,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110962079] [2020-02-10 20:16:42,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:42,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:42,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:42,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:42,177 INFO L87 Difference]: Start difference. First operand 1570 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:16:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:42,362 INFO L93 Difference]: Finished difference Result 2929 states and 11676 transitions. [2020-02-10 20:16:42,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:42,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:42,370 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:16:42,370 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:16:42,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:16:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1574. [2020-02-10 20:16:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:16:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 20:16:42,438 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 20:16:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:42,439 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 20:16:42,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 20:16:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:42,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:42,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:42,441 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash 368705932, now seen corresponding path program 316 times [2020-02-10 20:16:42,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:42,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068484353] [2020-02-10 20:16:42,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:42,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068484353] [2020-02-10 20:16:42,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:42,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:42,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660035737] [2020-02-10 20:16:42,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:42,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:42,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:42,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:42,956 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:16:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:43,134 INFO L93 Difference]: Finished difference Result 2928 states and 11670 transitions. [2020-02-10 20:16:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:43,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:43,141 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 20:16:43,142 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:16:43,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:16:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1570. [2020-02-10 20:16:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:16:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7043 transitions. [2020-02-10 20:16:43,205 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7043 transitions. Word has length 28 [2020-02-10 20:16:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:43,205 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7043 transitions. [2020-02-10 20:16:43,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7043 transitions. [2020-02-10 20:16:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:43,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:43,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:43,208 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:43,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:43,208 INFO L82 PathProgramCache]: Analyzing trace with hash 611777856, now seen corresponding path program 317 times [2020-02-10 20:16:43,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:43,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911227386] [2020-02-10 20:16:43,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:43,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911227386] [2020-02-10 20:16:43,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:43,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:43,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731125628] [2020-02-10 20:16:43,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:43,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:43,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:43,725 INFO L87 Difference]: Start difference. First operand 1570 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:16:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:43,855 INFO L93 Difference]: Finished difference Result 2940 states and 11692 transitions. [2020-02-10 20:16:43,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:43,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:43,863 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:16:43,863 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:16:43,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:16:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1575. [2020-02-10 20:16:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:16:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7051 transitions. [2020-02-10 20:16:43,927 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7051 transitions. Word has length 28 [2020-02-10 20:16:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:43,927 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7051 transitions. [2020-02-10 20:16:43,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7051 transitions. [2020-02-10 20:16:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:43,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:43,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:43,930 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:43,930 INFO L82 PathProgramCache]: Analyzing trace with hash -704379448, now seen corresponding path program 318 times [2020-02-10 20:16:43,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:43,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087546903] [2020-02-10 20:16:43,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:44,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087546903] [2020-02-10 20:16:44,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:44,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:44,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355738541] [2020-02-10 20:16:44,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:44,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:44,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:44,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:44,448 INFO L87 Difference]: Start difference. First operand 1575 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:16:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:44,621 INFO L93 Difference]: Finished difference Result 2934 states and 11676 transitions. [2020-02-10 20:16:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:44,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:44,629 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:16:44,629 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:16:44,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:16:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1565. [2020-02-10 20:16:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:16:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7029 transitions. [2020-02-10 20:16:44,694 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7029 transitions. Word has length 28 [2020-02-10 20:16:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:44,694 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7029 transitions. [2020-02-10 20:16:44,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7029 transitions. [2020-02-10 20:16:44,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:44,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:44,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:44,696 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:44,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:44,697 INFO L82 PathProgramCache]: Analyzing trace with hash -859246708, now seen corresponding path program 319 times [2020-02-10 20:16:44,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:44,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848751905] [2020-02-10 20:16:44,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:45,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848751905] [2020-02-10 20:16:45,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:45,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:45,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681939056] [2020-02-10 20:16:45,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:45,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:45,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:45,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:45,211 INFO L87 Difference]: Start difference. First operand 1565 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:16:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:45,408 INFO L93 Difference]: Finished difference Result 2945 states and 11714 transitions. [2020-02-10 20:16:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:45,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:45,416 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:16:45,416 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:16:45,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:16:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1577. [2020-02-10 20:16:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:16:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 20:16:45,502 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 20:16:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:45,502 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 20:16:45,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 20:16:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:45,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:45,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, 1, 1, 1] [2020-02-10 20:16:45,504 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash 630158288, now seen corresponding path program 320 times [2020-02-10 20:16:45,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:45,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880795127] [2020-02-10 20:16:45,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:46,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880795127] [2020-02-10 20:16:46,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:46,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:46,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167142046] [2020-02-10 20:16:46,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:46,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:46,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:46,035 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:16:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:46,203 INFO L93 Difference]: Finished difference Result 2950 states and 11718 transitions. [2020-02-10 20:16:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:46,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:46,211 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:16:46,211 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:16:46,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:16:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1571. [2020-02-10 20:16:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:16:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7045 transitions. [2020-02-10 20:16:46,276 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7045 transitions. Word has length 28 [2020-02-10 20:16:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:46,276 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7045 transitions. [2020-02-10 20:16:46,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7045 transitions. [2020-02-10 20:16:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:46,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:46,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:46,279 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:46,279 INFO L82 PathProgramCache]: Analyzing trace with hash 216464448, now seen corresponding path program 321 times [2020-02-10 20:16:46,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:46,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191794565] [2020-02-10 20:16:46,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:46,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191794565] [2020-02-10 20:16:46,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:46,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:46,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624401184] [2020-02-10 20:16:46,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:46,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:46,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:46,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:46,792 INFO L87 Difference]: Start difference. First operand 1571 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:16:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:46,974 INFO L93 Difference]: Finished difference Result 2941 states and 11701 transitions. [2020-02-10 20:16:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:46,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:46,982 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:16:46,982 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:16:46,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:16:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1576. [2020-02-10 20:16:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:16:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 20:16:47,045 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 20:16:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:47,045 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 20:16:47,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 20:16:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:47,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16: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, 1, 1, 1] [2020-02-10 20:16:47,048 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:47,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:47,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1879117136, now seen corresponding path program 322 times [2020-02-10 20:16:47,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:47,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303631988] [2020-02-10 20:16:47,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:47,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303631988] [2020-02-10 20:16:47,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:47,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:47,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606948093] [2020-02-10 20:16:47,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:47,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:47,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:47,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:47,560 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:16:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:47,744 INFO L93 Difference]: Finished difference Result 2943 states and 11700 transitions. [2020-02-10 20:16:47,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:47,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:47,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:47,752 INFO L225 Difference]: With dead ends: 2943 [2020-02-10 20:16:47,752 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:16:47,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:16:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1571. [2020-02-10 20:16:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:16:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:16:47,816 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:16:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:47,816 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:16:47,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:16:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:47,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:47,818 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:47,818 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash 632784064, now seen corresponding path program 323 times [2020-02-10 20:16:47,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:47,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788944161] [2020-02-10 20:16:47,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:48,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788944161] [2020-02-10 20:16:48,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:48,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:48,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986335389] [2020-02-10 20:16:48,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:48,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:48,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:48,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:48,343 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:16:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:48,480 INFO L93 Difference]: Finished difference Result 2954 states and 11722 transitions. [2020-02-10 20:16:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:48,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:48,487 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:16:48,487 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:16:48,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:16:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1579. [2020-02-10 20:16:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:16:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7054 transitions. [2020-02-10 20:16:48,550 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7054 transitions. Word has length 28 [2020-02-10 20:16:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:48,550 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7054 transitions. [2020-02-10 20:16:48,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7054 transitions. [2020-02-10 20:16:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:48,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:48,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:48,553 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash 806031756, now seen corresponding path program 324 times [2020-02-10 20:16:48,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:48,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765920243] [2020-02-10 20:16:48,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:49,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765920243] [2020-02-10 20:16:49,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:49,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:49,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375586941] [2020-02-10 20:16:49,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:49,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:49,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:49,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:49,083 INFO L87 Difference]: Start difference. First operand 1579 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:16:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:49,262 INFO L93 Difference]: Finished difference Result 2951 states and 11709 transitions. [2020-02-10 20:16:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:49,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:49,269 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:16:49,269 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:16:49,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:16:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1565. [2020-02-10 20:16:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:16:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7024 transitions. [2020-02-10 20:16:49,335 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7024 transitions. Word has length 28 [2020-02-10 20:16:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:49,335 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7024 transitions. [2020-02-10 20:16:49,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7024 transitions. [2020-02-10 20:16:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:49,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:49,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:49,337 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash -817234292, now seen corresponding path program 325 times [2020-02-10 20:16:49,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:49,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13691223] [2020-02-10 20:16:49,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:49,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13691223] [2020-02-10 20:16:49,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:49,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:49,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097483275] [2020-02-10 20:16:49,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:49,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:49,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:49,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:49,854 INFO L87 Difference]: Start difference. First operand 1565 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:16:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:50,065 INFO L93 Difference]: Finished difference Result 2923 states and 11659 transitions. [2020-02-10 20:16:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:50,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:50,073 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:16:50,073 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:16:50,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:16:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1573. [2020-02-10 20:16:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:16:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7046 transitions. [2020-02-10 20:16:50,138 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7046 transitions. Word has length 28 [2020-02-10 20:16:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:50,138 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7046 transitions. [2020-02-10 20:16:50,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7046 transitions. [2020-02-10 20:16:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:50,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:50,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:50,141 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash -643986600, now seen corresponding path program 326 times [2020-02-10 20:16:50,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:50,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537567027] [2020-02-10 20:16:50,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:50,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-02-10 20:16:50,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537567027] [2020-02-10 20:16:50,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:50,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:50,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754016249] [2020-02-10 20:16:50,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:50,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:50,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:50,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:50,682 INFO L87 Difference]: Start difference. First operand 1573 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:16:50,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:50,867 INFO L93 Difference]: Finished difference Result 2922 states and 11653 transitions. [2020-02-10 20:16:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:50,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:50,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:50,874 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:16:50,874 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:16:50,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:16:50,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1569. [2020-02-10 20:16:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:16:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7035 transitions. [2020-02-10 20:16:50,939 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7035 transitions. Word has length 28 [2020-02-10 20:16:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:50,939 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7035 transitions. [2020-02-10 20:16:50,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7035 transitions. [2020-02-10 20:16:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:50,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:50,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:50,942 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:50,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:50,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1890319672, now seen corresponding path program 327 times [2020-02-10 20:16:50,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:50,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639584224] [2020-02-10 20:16:50,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:51,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639584224] [2020-02-10 20:16:51,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:51,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:51,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019482224] [2020-02-10 20:16:51,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:51,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:51,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:51,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:51,459 INFO L87 Difference]: Start difference. First operand 1569 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:16:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:51,626 INFO L93 Difference]: Finished difference Result 2927 states and 11664 transitions. [2020-02-10 20:16:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:51,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:51,634 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:16:51,634 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:16:51,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:16:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1574. [2020-02-10 20:16:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:16:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7044 transitions. [2020-02-10 20:16:51,699 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7044 transitions. Word has length 28 [2020-02-10 20:16:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:51,700 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7044 transitions. [2020-02-10 20:16:51,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7044 transitions. [2020-02-10 20:16:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:51,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16: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, 1, 1, 1] [2020-02-10 20:16:51,702 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:51,702 INFO L82 PathProgramCache]: Analyzing trace with hash -227666984, now seen corresponding path program 328 times [2020-02-10 20:16:51,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:51,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265324716] [2020-02-10 20:16:51,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:52,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265324716] [2020-02-10 20:16:52,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:52,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:52,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005531464] [2020-02-10 20:16:52,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:52,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:52,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:52,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:52,215 INFO L87 Difference]: Start difference. First operand 1574 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:16:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:52,395 INFO L93 Difference]: Finished difference Result 2929 states and 11663 transitions. [2020-02-10 20:16:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:52,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:52,403 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:16:52,403 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:16:52,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:16:52,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1569. [2020-02-10 20:16:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:16:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7031 transitions. [2020-02-10 20:16:52,469 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7031 transitions. Word has length 28 [2020-02-10 20:16:52,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:52,469 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7031 transitions. [2020-02-10 20:16:52,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7031 transitions. [2020-02-10 20:16:52,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:52,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:52,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, 1, 1, 1] [2020-02-10 20:16:52,471 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:52,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:52,472 INFO L82 PathProgramCache]: Analyzing trace with hash -641360824, now seen corresponding path program 329 times [2020-02-10 20:16:52,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:52,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553055754] [2020-02-10 20:16:52,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:52,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553055754] [2020-02-10 20:16:52,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:52,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:52,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041319256] [2020-02-10 20:16:52,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:52,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:52,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:52,981 INFO L87 Difference]: Start difference. First operand 1569 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:16:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:53,155 INFO L93 Difference]: Finished difference Result 2924 states and 11653 transitions. [2020-02-10 20:16:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:53,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:53,163 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:16:53,163 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:16:53,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:16:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1573. [2020-02-10 20:16:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:16:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7038 transitions. [2020-02-10 20:16:53,227 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7038 transitions. Word has length 28 [2020-02-10 20:16:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:53,227 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7038 transitions. [2020-02-10 20:16:53,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7038 transitions. [2020-02-10 20:16:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:53,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:53,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:53,230 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash 848044172, now seen corresponding path program 330 times [2020-02-10 20:16:53,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:53,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579899484] [2020-02-10 20:16:53,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:53,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579899484] [2020-02-10 20:16:53,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:53,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:53,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74759174] [2020-02-10 20:16:53,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:53,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:53,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:53,737 INFO L87 Difference]: Start difference. First operand 1573 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:16:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:53,912 INFO L93 Difference]: Finished difference Result 2927 states and 11655 transitions. [2020-02-10 20:16:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:53,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:53,920 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:16:53,920 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 20:16:53,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 20:16:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1565. [2020-02-10 20:16:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:16:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7020 transitions. [2020-02-10 20:16:53,984 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7020 transitions. Word has length 28 [2020-02-10 20:16:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:53,984 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7020 transitions. [2020-02-10 20:16:53,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7020 transitions. [2020-02-10 20:16:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:53,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:53,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:53,986 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:53,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:53,987 INFO L82 PathProgramCache]: Analyzing trace with hash 693176912, now seen corresponding path program 331 times [2020-02-10 20:16:53,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:53,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191692476] [2020-02-10 20:16:53,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:54,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191692476] [2020-02-10 20:16:54,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:54,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:54,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632671086] [2020-02-10 20:16:54,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:54,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:54,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:54,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:54,509 INFO L87 Difference]: Start difference. First operand 1565 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:16:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:54,652 INFO L93 Difference]: Finished difference Result 2944 states and 11697 transitions. [2020-02-10 20:16:54,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:54,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:54,660 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:16:54,661 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:16:54,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:16:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1575. [2020-02-10 20:16:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:16:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7046 transitions. [2020-02-10 20:16:54,724 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7046 transitions. Word has length 28 [2020-02-10 20:16:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:54,724 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7046 transitions. [2020-02-10 20:16:54,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7046 transitions. [2020-02-10 20:16:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:54,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:54,726 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:54,726 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash -622980392, now seen corresponding path program 332 times [2020-02-10 20:16:54,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:54,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272535186] [2020-02-10 20:16:54,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:55,149 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2020-02-10 20:16:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:55,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272535186] [2020-02-10 20:16:55,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:55,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:55,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98012983] [2020-02-10 20:16:55,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:55,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:55,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:55,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:55,269 INFO L87 Difference]: Start difference. First operand 1575 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:16:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:55,437 INFO L93 Difference]: Finished difference Result 2938 states and 11681 transitions. [2020-02-10 20:16:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:55,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:55,444 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:16:55,444 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 20:16:55,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 20:16:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1570. [2020-02-10 20:16:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:16:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7033 transitions. [2020-02-10 20:16:55,508 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7033 transitions. Word has length 28 [2020-02-10 20:16:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:55,508 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7033 transitions. [2020-02-10 20:16:55,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7033 transitions. [2020-02-10 20:16:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:55,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:55,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:55,510 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:55,510 INFO L82 PathProgramCache]: Analyzing trace with hash -379908468, now seen corresponding path program 333 times [2020-02-10 20:16:55,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:55,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821509633] [2020-02-10 20:16:55,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:56,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821509633] [2020-02-10 20:16:56,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:56,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:56,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365192528] [2020-02-10 20:16:56,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:56,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:56,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:56,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:56,036 INFO L87 Difference]: Start difference. First operand 1570 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:16:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:56,179 INFO L93 Difference]: Finished difference Result 2950 states and 11707 transitions. [2020-02-10 20:16:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:56,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:56,187 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:16:56,188 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:16:56,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:16:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1578. [2020-02-10 20:16:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:16:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7047 transitions. [2020-02-10 20:16:56,253 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7047 transitions. Word has length 28 [2020-02-10 20:16:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:56,253 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7047 transitions. [2020-02-10 20:16:56,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7047 transitions. [2020-02-10 20:16:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:56,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:56,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, 1, 1, 1] [2020-02-10 20:16:56,256 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:56,256 INFO L82 PathProgramCache]: Analyzing trace with hash -206660776, now seen corresponding path program 334 times [2020-02-10 20:16:56,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:56,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046084326] [2020-02-10 20:16:56,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:56,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046084326] [2020-02-10 20:16:56,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:56,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:56,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938355540] [2020-02-10 20:16:56,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:56,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:56,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:56,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:56,775 INFO L87 Difference]: Start difference. First operand 1578 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:16:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:56,950 INFO L93 Difference]: Finished difference Result 2947 states and 11694 transitions. [2020-02-10 20:16:56,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:56,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:56,958 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:16:56,958 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 20:16:56,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 20:16:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1570. [2020-02-10 20:16:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:16:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7028 transitions. [2020-02-10 20:16:57,022 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7028 transitions. Word has length 28 [2020-02-10 20:16:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:57,022 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7028 transitions. [2020-02-10 20:16:57,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7028 transitions. [2020-02-10 20:16:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:57,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:57,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, 1, 1, 1] [2020-02-10 20:16:57,024 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:57,025 INFO L82 PathProgramCache]: Analyzing trace with hash 452730764, now seen corresponding path program 335 times [2020-02-10 20:16:57,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:57,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443620213] [2020-02-10 20:16:57,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:57,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443620213] [2020-02-10 20:16:57,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:57,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:57,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841107102] [2020-02-10 20:16:57,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:57,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:57,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:57,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:57,546 INFO L87 Difference]: Start difference. First operand 1570 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:16:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:57,768 INFO L93 Difference]: Finished difference Result 2934 states and 11669 transitions. [2020-02-10 20:16:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:57,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:57,777 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:16:57,777 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:16:57,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:16:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1574. [2020-02-10 20:16:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:16:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7035 transitions. [2020-02-10 20:16:57,840 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7035 transitions. Word has length 28 [2020-02-10 20:16:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:57,840 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7035 transitions. [2020-02-10 20:16:57,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7035 transitions. [2020-02-10 20:16:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:57,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:57,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:57,843 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1942135760, now seen corresponding path program 336 times [2020-02-10 20:16:57,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:57,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19979935] [2020-02-10 20:16:57,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:58,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19979935] [2020-02-10 20:16:58,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:58,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:58,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081293995] [2020-02-10 20:16:58,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:58,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:58,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:58,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:58,363 INFO L87 Difference]: Start difference. First operand 1574 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:16:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:58,563 INFO L93 Difference]: Finished difference Result 2937 states and 11671 transitions. [2020-02-10 20:16:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:58,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:58,571 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:16:58,571 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:16:58,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:16:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1560. [2020-02-10 20:16:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 20:16:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7006 transitions. [2020-02-10 20:16:58,634 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7006 transitions. Word has length 28 [2020-02-10 20:16:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:58,634 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7006 transitions. [2020-02-10 20:16:58,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7006 transitions. [2020-02-10 20:16:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:58,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:58,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:58,637 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:58,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:58,637 INFO L82 PathProgramCache]: Analyzing trace with hash 727901384, now seen corresponding path program 337 times [2020-02-10 20:16:58,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:58,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790273667] [2020-02-10 20:16:58,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:59,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790273667] [2020-02-10 20:16:59,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:59,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:59,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564088564] [2020-02-10 20:16:59,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:59,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:59,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:59,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:59,150 INFO L87 Difference]: Start difference. First operand 1560 states and 7006 transitions. Second operand 11 states. [2020-02-10 20:16:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:59,363 INFO L93 Difference]: Finished difference Result 2946 states and 11716 transitions. [2020-02-10 20:16:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:16:59,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:16:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:59,371 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:16:59,371 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:16:59,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:16:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:16:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1577. [2020-02-10 20:16:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:16:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7060 transitions. [2020-02-10 20:16:59,435 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7060 transitions. Word has length 28 [2020-02-10 20:16:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:59,435 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7060 transitions. [2020-02-10 20:16:59,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:16:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7060 transitions. [2020-02-10 20:16:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:16:59,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:59,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, 1, 1, 1] [2020-02-10 20:16:59,438 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:59,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1472603882, now seen corresponding path program 338 times [2020-02-10 20:16:59,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:59,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566294626] [2020-02-10 20:16:59,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:59,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566294626] [2020-02-10 20:16:59,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:59,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:16:59,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475226605] [2020-02-10 20:16:59,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:16:59,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:59,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:16:59,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:59,963 INFO L87 Difference]: Start difference. First operand 1577 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:17:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:00,138 INFO L93 Difference]: Finished difference Result 2950 states and 11717 transitions. [2020-02-10 20:17:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:00,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:00,146 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:17:00,147 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 20:17:00,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 20:17:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1570. [2020-02-10 20:17:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:17:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7042 transitions. [2020-02-10 20:17:00,210 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7042 transitions. Word has length 28 [2020-02-10 20:17:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:00,210 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7042 transitions. [2020-02-10 20:17:00,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7042 transitions. [2020-02-10 20:17:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:00,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:00,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:00,213 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1418269376, now seen corresponding path program 339 times [2020-02-10 20:17:00,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:00,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238807487] [2020-02-10 20:17:00,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:00,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238807487] [2020-02-10 20:17:00,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:00,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:00,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928911025] [2020-02-10 20:17:00,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:00,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:00,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:00,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:00,723 INFO L87 Difference]: Start difference. First operand 1570 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:17:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:00,900 INFO L93 Difference]: Finished difference Result 2937 states and 11692 transitions. [2020-02-10 20:17:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:00,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:00,908 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:17:00,908 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:17:00,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:17:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1574. [2020-02-10 20:17:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:17:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7049 transitions. [2020-02-10 20:17:00,971 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7049 transitions. Word has length 28 [2020-02-10 20:17:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:00,971 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7049 transitions. [2020-02-10 20:17:00,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7049 transitions. [2020-02-10 20:17:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:00,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:00,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:00,974 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:00,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1989724182, now seen corresponding path program 340 times [2020-02-10 20:17:00,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:00,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017882974] [2020-02-10 20:17:00,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:01,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-02-10 20:17:01,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017882974] [2020-02-10 20:17:01,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:01,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:01,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001617702] [2020-02-10 20:17:01,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:01,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:01,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:01,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:01,488 INFO L87 Difference]: Start difference. First operand 1574 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:17:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:01,679 INFO L93 Difference]: Finished difference Result 2935 states and 11684 transitions. [2020-02-10 20:17:01,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:01,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:01,687 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 20:17:01,687 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 20:17:01,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 20:17:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1570. [2020-02-10 20:17:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:17:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7038 transitions. [2020-02-10 20:17:01,750 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7038 transitions. Word has length 28 [2020-02-10 20:17:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:01,750 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7038 transitions. [2020-02-10 20:17:01,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7038 transitions. [2020-02-10 20:17:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:01,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:01,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, 1, 1, 1] [2020-02-10 20:17:01,753 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash 937374080, now seen corresponding path program 341 times [2020-02-10 20:17:01,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:01,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055185730] [2020-02-10 20:17:01,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:02,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055185730] [2020-02-10 20:17:02,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:02,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:02,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549049708] [2020-02-10 20:17:02,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:02,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:02,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:02,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:02,251 INFO L87 Difference]: Start difference. First operand 1570 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:17:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:02,403 INFO L93 Difference]: Finished difference Result 2946 states and 11704 transitions. [2020-02-10 20:17:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:02,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:02,410 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:17:02,410 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:17:02,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:17:02,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1575. [2020-02-10 20:17:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:17:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7046 transitions. [2020-02-10 20:17:02,473 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7046 transitions. Word has length 28 [2020-02-10 20:17:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:02,474 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7046 transitions. [2020-02-10 20:17:02,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7046 transitions. [2020-02-10 20:17:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:02,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:02,476 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:02,476 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:02,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:02,476 INFO L82 PathProgramCache]: Analyzing trace with hash -378783224, now seen corresponding path program 342 times [2020-02-10 20:17:02,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:02,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804356730] [2020-02-10 20:17:02,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:02,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804356730] [2020-02-10 20:17:02,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:02,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:02,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404525402] [2020-02-10 20:17:02,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:02,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:02,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:02,987 INFO L87 Difference]: Start difference. First operand 1575 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:17:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:03,209 INFO L93 Difference]: Finished difference Result 2940 states and 11688 transitions. [2020-02-10 20:17:03,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:03,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:03,216 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:17:03,217 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:17:03,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:17:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1565. [2020-02-10 20:17:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:17:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7024 transitions. [2020-02-10 20:17:03,280 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7024 transitions. Word has length 28 [2020-02-10 20:17:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:03,280 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7024 transitions. [2020-02-10 20:17:03,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7024 transitions. [2020-02-10 20:17:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:03,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17: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, 1, 1, 1] [2020-02-10 20:17:03,283 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:03,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1821992972, now seen corresponding path program 343 times [2020-02-10 20:17:03,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:03,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284226824] [2020-02-10 20:17:03,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:03,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284226824] [2020-02-10 20:17:03,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:03,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:03,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530539195] [2020-02-10 20:17:03,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:03,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:03,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:03,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:03,809 INFO L87 Difference]: Start difference. First operand 1565 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:17:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:03,998 INFO L93 Difference]: Finished difference Result 2956 states and 11740 transitions. [2020-02-10 20:17:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:03,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:04,006 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:17:04,006 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:17:04,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:17:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1579. [2020-02-10 20:17:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:17:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7063 transitions. [2020-02-10 20:17:04,071 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7063 transitions. Word has length 28 [2020-02-10 20:17:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:04,071 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7063 transitions. [2020-02-10 20:17:04,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7063 transitions. [2020-02-10 20:17:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:04,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:04,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:04,073 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:04,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1728271826, now seen corresponding path program 344 times [2020-02-10 20:17:04,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:04,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838544381] [2020-02-10 20:17:04,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:04,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838544381] [2020-02-10 20:17:04,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:04,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:04,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787979067] [2020-02-10 20:17:04,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:04,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:04,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:04,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:04,600 INFO L87 Difference]: Start difference. First operand 1579 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:17:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:04,763 INFO L93 Difference]: Finished difference Result 2960 states and 11741 transitions. [2020-02-10 20:17:04,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:04,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:04,771 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 20:17:04,771 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:17:04,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:17:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 20:17:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:17:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7043 transitions. [2020-02-10 20:17:04,836 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7043 transitions. Word has length 28 [2020-02-10 20:17:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:04,836 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7043 transitions. [2020-02-10 20:17:04,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7043 transitions. [2020-02-10 20:17:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:04,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:04,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:04,862 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1397263168, now seen corresponding path program 345 times [2020-02-10 20:17:04,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:04,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510233483] [2020-02-10 20:17:04,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:05,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510233483] [2020-02-10 20:17:05,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:05,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:05,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612014605] [2020-02-10 20:17:05,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:05,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:05,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:05,374 INFO L87 Difference]: Start difference. First operand 1572 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:17:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:05,559 INFO L93 Difference]: Finished difference Result 2952 states and 11726 transitions. [2020-02-10 20:17:05,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:05,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:05,566 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:17:05,567 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:17:05,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:17:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1578. [2020-02-10 20:17:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:17:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7054 transitions. [2020-02-10 20:17:05,629 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7054 transitions. Word has length 28 [2020-02-10 20:17:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:05,630 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7054 transitions. [2020-02-10 20:17:05,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7054 transitions. [2020-02-10 20:17:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:05,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:05,632 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:05,632 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:05,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:05,632 INFO L82 PathProgramCache]: Analyzing trace with hash -479312978, now seen corresponding path program 346 times [2020-02-10 20:17:05,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:05,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727434745] [2020-02-10 20:17:05,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:06,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727434745] [2020-02-10 20:17:06,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:06,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:06,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960426920] [2020-02-10 20:17:06,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:06,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:06,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:06,150 INFO L87 Difference]: Start difference. First operand 1578 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:17:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:06,357 INFO L93 Difference]: Finished difference Result 2953 states and 11722 transitions. [2020-02-10 20:17:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:06,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:06,365 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:17:06,365 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:17:06,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:17:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1572. [2020-02-10 20:17:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:17:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7037 transitions. [2020-02-10 20:17:06,429 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7037 transitions. Word has length 28 [2020-02-10 20:17:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:06,429 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7037 transitions. [2020-02-10 20:17:06,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7037 transitions. [2020-02-10 20:17:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:06,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:06,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:06,432 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:06,432 INFO L82 PathProgramCache]: Analyzing trace with hash 958380288, now seen corresponding path program 347 times [2020-02-10 20:17:06,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:06,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823045873] [2020-02-10 20:17:06,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:06,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823045873] [2020-02-10 20:17:06,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:06,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:06,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135098418] [2020-02-10 20:17:06,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:06,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:06,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:06,963 INFO L87 Difference]: Start difference. First operand 1572 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:17:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:07,117 INFO L93 Difference]: Finished difference Result 2962 states and 11739 transitions. [2020-02-10 20:17:07,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:07,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:07,124 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:17:07,125 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:17:07,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:17:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1580. [2020-02-10 20:17:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:17:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7051 transitions. [2020-02-10 20:17:07,189 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7051 transitions. Word has length 28 [2020-02-10 20:17:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:07,189 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7051 transitions. [2020-02-10 20:17:07,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7051 transitions. [2020-02-10 20:17:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:07,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:07,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:07,192 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:07,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:07,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1131627980, now seen corresponding path program 348 times [2020-02-10 20:17:07,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:07,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486386709] [2020-02-10 20:17:07,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:07,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486386709] [2020-02-10 20:17:07,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:07,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:07,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610058317] [2020-02-10 20:17:07,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:07,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:07,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:07,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:07,720 INFO L87 Difference]: Start difference. First operand 1580 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:17:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:07,891 INFO L93 Difference]: Finished difference Result 2959 states and 11726 transitions. [2020-02-10 20:17:07,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:07,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:07,899 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:17:07,900 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:17:07,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:17:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1565. [2020-02-10 20:17:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:17:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7019 transitions. [2020-02-10 20:17:07,963 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7019 transitions. Word has length 28 [2020-02-10 20:17:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:07,964 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7019 transitions. [2020-02-10 20:17:07,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7019 transitions. [2020-02-10 20:17:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:07,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:07,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:07,966 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1864005388, now seen corresponding path program 349 times [2020-02-10 20:17:07,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:07,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391142658] [2020-02-10 20:17:07,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:08,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391142658] [2020-02-10 20:17:08,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:08,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:08,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971115360] [2020-02-10 20:17:08,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:08,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:08,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:08,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:08,479 INFO L87 Difference]: Start difference. First operand 1565 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:17:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:08,661 INFO L93 Difference]: Finished difference Result 2931 states and 11675 transitions. [2020-02-10 20:17:08,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:08,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:08,669 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 20:17:08,669 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 20:17:08,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 20:17:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1573. [2020-02-10 20:17:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:17:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7041 transitions. [2020-02-10 20:17:08,732 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7041 transitions. Word has length 28 [2020-02-10 20:17:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:08,732 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7041 transitions. [2020-02-10 20:17:08,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7041 transitions. [2020-02-10 20:17:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:08,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:08,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:08,735 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:08,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1292550582, now seen corresponding path program 350 times [2020-02-10 20:17:08,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:08,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530690268] [2020-02-10 20:17:08,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:09,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530690268] [2020-02-10 20:17:09,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:09,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:09,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513414409] [2020-02-10 20:17:09,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:09,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:09,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:09,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:09,244 INFO L87 Difference]: Start difference. First operand 1573 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:17:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:09,418 INFO L93 Difference]: Finished difference Result 2929 states and 11667 transitions. [2020-02-10 20:17:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:09,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:09,426 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:17:09,426 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:17:09,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:17:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1569. [2020-02-10 20:17:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:17:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7030 transitions. [2020-02-10 20:17:09,492 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7030 transitions. Word has length 28 [2020-02-10 20:17:09,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:09,492 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7030 transitions. [2020-02-10 20:17:09,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7030 transitions. [2020-02-10 20:17:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:09,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:09,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, 1, 1, 1] [2020-02-10 20:17:09,494 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash 790920008, now seen corresponding path program 351 times [2020-02-10 20:17:09,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:09,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15131926] [2020-02-10 20:17:09,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:09,828 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 20:17:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:10,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15131926] [2020-02-10 20:17:10,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:10,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:10,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250069182] [2020-02-10 20:17:10,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:10,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:10,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:10,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:10,054 INFO L87 Difference]: Start difference. First operand 1569 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:17:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:10,230 INFO L93 Difference]: Finished difference Result 2936 states and 11683 transitions. [2020-02-10 20:17:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:10,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:10,238 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 20:17:10,238 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:17:10,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:17:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1575. [2020-02-10 20:17:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:17:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7041 transitions. [2020-02-10 20:17:10,303 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7041 transitions. Word has length 28 [2020-02-10 20:17:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:10,303 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7041 transitions. [2020-02-10 20:17:10,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7041 transitions. [2020-02-10 20:17:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:10,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:10,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:10,306 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1708870198, now seen corresponding path program 352 times [2020-02-10 20:17:10,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:10,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878311308] [2020-02-10 20:17:10,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:10,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878311308] [2020-02-10 20:17:10,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:10,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:10,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481492198] [2020-02-10 20:17:10,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:10,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:10,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:10,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:10,829 INFO L87 Difference]: Start difference. First operand 1575 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:17:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:11,006 INFO L93 Difference]: Finished difference Result 2937 states and 11679 transitions. [2020-02-10 20:17:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:11,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:11,013 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:17:11,014 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:17:11,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:17:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1569. [2020-02-10 20:17:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:17:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7026 transitions. [2020-02-10 20:17:11,077 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7026 transitions. Word has length 28 [2020-02-10 20:17:11,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:11,077 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7026 transitions. [2020-02-10 20:17:11,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7026 transitions. [2020-02-10 20:17:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:11,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:11,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:11,079 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash -315764600, now seen corresponding path program 353 times [2020-02-10 20:17:11,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:11,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092693579] [2020-02-10 20:17:11,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:11,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092693579] [2020-02-10 20:17:11,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:11,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:11,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727641704] [2020-02-10 20:17:11,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:11,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:11,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:11,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:11,593 INFO L87 Difference]: Start difference. First operand 1569 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:17:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:11,797 INFO L93 Difference]: Finished difference Result 2930 states and 11665 transitions. [2020-02-10 20:17:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:11,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:11,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:11,804 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:17:11,804 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:17:11,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:17:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1573. [2020-02-10 20:17:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:17:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7033 transitions. [2020-02-10 20:17:11,869 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7033 transitions. Word has length 28 [2020-02-10 20:17:11,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:11,870 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7033 transitions. [2020-02-10 20:17:11,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7033 transitions. [2020-02-10 20:17:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:11,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:11,872 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:11,872 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:11,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1173640396, now seen corresponding path program 354 times [2020-02-10 20:17:11,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:11,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672080768] [2020-02-10 20:17:11,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:12,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672080768] [2020-02-10 20:17:12,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:12,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:12,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911789094] [2020-02-10 20:17:12,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:12,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:12,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:12,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:12,404 INFO L87 Difference]: Start difference. First operand 1573 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:17:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:12,584 INFO L93 Difference]: Finished difference Result 2933 states and 11667 transitions. [2020-02-10 20:17:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:12,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:12,592 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:17:12,592 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:17:12,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:17:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1565. [2020-02-10 20:17:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:17:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7015 transitions. [2020-02-10 20:17:12,655 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7015 transitions. Word has length 28 [2020-02-10 20:17:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:12,656 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7015 transitions. [2020-02-10 20:17:12,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7015 transitions. [2020-02-10 20:17:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:12,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:12,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:12,658 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1675756306, now seen corresponding path program 355 times [2020-02-10 20:17:12,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:12,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788373878] [2020-02-10 20:17:12,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:13,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788373878] [2020-02-10 20:17:13,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:13,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:13,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173678769] [2020-02-10 20:17:13,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:13,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:13,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:13,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:13,180 INFO L87 Difference]: Start difference. First operand 1565 states and 7015 transitions. Second operand 11 states. [2020-02-10 20:17:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:13,316 INFO L93 Difference]: Finished difference Result 2948 states and 11704 transitions. [2020-02-10 20:17:13,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:13,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:13,323 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:17:13,323 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:17:13,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:17:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1575. [2020-02-10 20:17:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:17:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7041 transitions. [2020-02-10 20:17:13,388 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7041 transitions. Word has length 28 [2020-02-10 20:17:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:13,388 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7041 transitions. [2020-02-10 20:17:13,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7041 transitions. [2020-02-10 20:17:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:13,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:13,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, 1, 1, 1] [2020-02-10 20:17:13,391 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:13,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1303053686, now seen corresponding path program 356 times [2020-02-10 20:17:13,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:13,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066690596] [2020-02-10 20:17:13,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:13,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066690596] [2020-02-10 20:17:13,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:13,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:13,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977061313] [2020-02-10 20:17:13,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:13,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:13,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:13,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:13,913 INFO L87 Difference]: Start difference. First operand 1575 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:17:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:14,100 INFO L93 Difference]: Finished difference Result 2942 states and 11688 transitions. [2020-02-10 20:17:14,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:14,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:14,107 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:17:14,108 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 20:17:14,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 20:17:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1570. [2020-02-10 20:17:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:17:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7028 transitions. [2020-02-10 20:17:14,171 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7028 transitions. Word has length 28 [2020-02-10 20:17:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:14,171 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7028 transitions. [2020-02-10 20:17:14,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7028 transitions. [2020-02-10 20:17:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:14,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:14,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:14,174 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:14,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1546125610, now seen corresponding path program 357 times [2020-02-10 20:17:14,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:14,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078466291] [2020-02-10 20:17:14,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:14,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078466291] [2020-02-10 20:17:14,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:14,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:14,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720597018] [2020-02-10 20:17:14,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:14,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:14,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:14,701 INFO L87 Difference]: Start difference. First operand 1570 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:17:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:14,880 INFO L93 Difference]: Finished difference Result 2954 states and 11714 transitions. [2020-02-10 20:17:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:14,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:14,887 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:17:14,887 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:17:14,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:17:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1578. [2020-02-10 20:17:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:17:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7042 transitions. [2020-02-10 20:17:14,951 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7042 transitions. Word has length 28 [2020-02-10 20:17:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:14,951 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7042 transitions. [2020-02-10 20:17:14,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7042 transitions. [2020-02-10 20:17:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:14,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:14,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:14,953 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1719373302, now seen corresponding path program 358 times [2020-02-10 20:17:14,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:14,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713913099] [2020-02-10 20:17:14,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:15,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713913099] [2020-02-10 20:17:15,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:15,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:15,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174866611] [2020-02-10 20:17:15,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:15,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:15,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:15,475 INFO L87 Difference]: Start difference. First operand 1578 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:17:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:15,692 INFO L93 Difference]: Finished difference Result 2951 states and 11701 transitions. [2020-02-10 20:17:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:15,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:15,700 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:17:15,700 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:17:15,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:17:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1570. [2020-02-10 20:17:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:17:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7023 transitions. [2020-02-10 20:17:15,764 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7023 transitions. Word has length 28 [2020-02-10 20:17:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:15,764 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7023 transitions. [2020-02-10 20:17:15,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7023 transitions. [2020-02-10 20:17:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:15,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:15,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:15,767 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1916202454, now seen corresponding path program 359 times [2020-02-10 20:17:15,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:15,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835092546] [2020-02-10 20:17:15,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:16,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835092546] [2020-02-10 20:17:16,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:16,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:16,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311265464] [2020-02-10 20:17:16,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:16,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:16,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:16,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:16,297 INFO L87 Difference]: Start difference. First operand 1570 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:17:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:16,478 INFO L93 Difference]: Finished difference Result 2938 states and 11676 transitions. [2020-02-10 20:17:16,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:16,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:16,485 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:17:16,486 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:17:16,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:17:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1574. [2020-02-10 20:17:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:17:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7030 transitions. [2020-02-10 20:17:16,549 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7030 transitions. Word has length 28 [2020-02-10 20:17:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:16,549 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7030 transitions. [2020-02-10 20:17:16,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7030 transitions. [2020-02-10 20:17:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:16,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:16,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:16,552 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash -426797458, now seen corresponding path program 360 times [2020-02-10 20:17:16,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:16,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806616539] [2020-02-10 20:17:16,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:17,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806616539] [2020-02-10 20:17:17,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:17,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:17,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70555144] [2020-02-10 20:17:17,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:17,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:17,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:17,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:17,069 INFO L87 Difference]: Start difference. First operand 1574 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:17:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:17,285 INFO L93 Difference]: Finished difference Result 2941 states and 11678 transitions. [2020-02-10 20:17:17,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:17,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:17,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:17,294 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:17:17,294 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:17:17,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:17:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1555. [2020-02-10 20:17:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 20:17:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6992 transitions. [2020-02-10 20:17:17,357 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6992 transitions. Word has length 28 [2020-02-10 20:17:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:17,357 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6992 transitions. [2020-02-10 20:17:17,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6992 transitions. [2020-02-10 20:17:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:17,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:17,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:17,360 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:17,360 INFO L82 PathProgramCache]: Analyzing trace with hash 313455144, now seen corresponding path program 361 times [2020-02-10 20:17:17,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:17,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909254408] [2020-02-10 20:17:17,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:17,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909254408] [2020-02-10 20:17:17,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:17,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:17,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673064090] [2020-02-10 20:17:17,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:17,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:17,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:17,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:17,885 INFO L87 Difference]: Start difference. First operand 1555 states and 6992 transitions. Second operand 11 states. [2020-02-10 20:17:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:18,098 INFO L93 Difference]: Finished difference Result 2905 states and 11627 transitions. [2020-02-10 20:17:18,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:18,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:18,106 INFO L225 Difference]: With dead ends: 2905 [2020-02-10 20:17:18,106 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:17:18,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:17:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1573. [2020-02-10 20:17:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:17:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7062 transitions. [2020-02-10 20:17:18,169 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7062 transitions. Word has length 28 [2020-02-10 20:17:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:18,169 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7062 transitions. [2020-02-10 20:17:18,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7062 transitions. [2020-02-10 20:17:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:18,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:18,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:18,172 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1058157642, now seen corresponding path program 362 times [2020-02-10 20:17:18,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:18,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324013218] [2020-02-10 20:17:18,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:18,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324013218] [2020-02-10 20:17:18,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:18,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:18,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333071692] [2020-02-10 20:17:18,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:18,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:18,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:18,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:18,692 INFO L87 Difference]: Start difference. First operand 1573 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:17:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:18,906 INFO L93 Difference]: Finished difference Result 2906 states and 11624 transitions. [2020-02-10 20:17:18,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:18,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:18,913 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:17:18,913 INFO L226 Difference]: Without dead ends: 2885 [2020-02-10 20:17:18,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2020-02-10 20:17:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1568. [2020-02-10 20:17:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:17:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7048 transitions. [2020-02-10 20:17:18,976 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7048 transitions. Word has length 28 [2020-02-10 20:17:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:18,976 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7048 transitions. [2020-02-10 20:17:18,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7048 transitions. [2020-02-10 20:17:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:18,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:18,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:18,979 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:18,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:18,979 INFO L82 PathProgramCache]: Analyzing trace with hash -759630236, now seen corresponding path program 363 times [2020-02-10 20:17:18,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:18,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605564128] [2020-02-10 20:17:18,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:19,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605564128] [2020-02-10 20:17:19,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:19,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:19,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928766408] [2020-02-10 20:17:19,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:19,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:19,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:19,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:19,494 INFO L87 Difference]: Start difference. First operand 1568 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:17:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:19,741 INFO L93 Difference]: Finished difference Result 2907 states and 11626 transitions. [2020-02-10 20:17:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:19,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:19,749 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 20:17:19,749 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 20:17:19,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 20:17:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1573. [2020-02-10 20:17:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:17:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 20:17:19,812 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 20:17:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:19,812 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 20:17:19,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 20:17:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:19,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:19,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:19,815 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:19,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1474477258, now seen corresponding path program 364 times [2020-02-10 20:17:19,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:19,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21053355] [2020-02-10 20:17:19,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:20,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21053355] [2020-02-10 20:17:20,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:20,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:20,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990984134] [2020-02-10 20:17:20,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:20,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:20,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:20,325 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:17:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:20,552 INFO L93 Difference]: Finished difference Result 2910 states and 11627 transitions. [2020-02-10 20:17:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:20,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:20,559 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:17:20,560 INFO L226 Difference]: Without dead ends: 2887 [2020-02-10 20:17:20,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2020-02-10 20:17:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1568. [2020-02-10 20:17:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:17:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7043 transitions. [2020-02-10 20:17:20,624 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7043 transitions. Word has length 28 [2020-02-10 20:17:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:20,624 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7043 transitions. [2020-02-10 20:17:20,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7043 transitions. [2020-02-10 20:17:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:20,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17: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, 1, 1, 1] [2020-02-10 20:17:20,627 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:20,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1596013220, now seen corresponding path program 365 times [2020-02-10 20:17:20,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:20,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943431549] [2020-02-10 20:17:20,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:21,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943431549] [2020-02-10 20:17:21,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:21,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:21,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978249798] [2020-02-10 20:17:21,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:21,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:21,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:21,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:21,144 INFO L87 Difference]: Start difference. First operand 1568 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:17:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:21,383 INFO L93 Difference]: Finished difference Result 2910 states and 11628 transitions. [2020-02-10 20:17:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:21,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:21,390 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:17:21,390 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 20:17:21,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:21,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 20:17:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1574. [2020-02-10 20:17:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:17:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 20:17:21,458 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 20:17:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:21,458 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 20:17:21,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 20:17:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:21,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:21,461 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:21,461 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:21,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:21,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1209549080, now seen corresponding path program 366 times [2020-02-10 20:17:21,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:21,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149826991] [2020-02-10 20:17:21,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:21,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149826991] [2020-02-10 20:17:21,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:21,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:21,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294734588] [2020-02-10 20:17:21,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:21,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:21,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:21,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:21,971 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:17:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:22,170 INFO L93 Difference]: Finished difference Result 2912 states and 11626 transitions. [2020-02-10 20:17:22,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:22,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:22,178 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:17:22,178 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:17:22,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:17:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1563. [2020-02-10 20:17:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:17:22,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7030 transitions. [2020-02-10 20:17:22,241 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7030 transitions. Word has length 28 [2020-02-10 20:17:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:22,241 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7030 transitions. [2020-02-10 20:17:22,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7030 transitions. [2020-02-10 20:17:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:22,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:22,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:22,244 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash -192891122, now seen corresponding path program 367 times [2020-02-10 20:17:22,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:22,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405967120] [2020-02-10 20:17:22,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:22,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405967120] [2020-02-10 20:17:22,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:22,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:22,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207180536] [2020-02-10 20:17:22,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:22,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:22,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:22,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:22,775 INFO L87 Difference]: Start difference. First operand 1563 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:17:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:22,961 INFO L93 Difference]: Finished difference Result 2897 states and 11602 transitions. [2020-02-10 20:17:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:22,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:22,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:22,969 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:17:22,969 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 20:17:22,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 20:17:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1572. [2020-02-10 20:17:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:17:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7054 transitions. [2020-02-10 20:17:23,032 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7054 transitions. Word has length 28 [2020-02-10 20:17:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:23,032 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7054 transitions. [2020-02-10 20:17:23,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7054 transitions. [2020-02-10 20:17:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:23,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:23,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, 1, 1, 1] [2020-02-10 20:17:23,034 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:23,035 INFO L82 PathProgramCache]: Analyzing trace with hash 551811376, now seen corresponding path program 368 times [2020-02-10 20:17:23,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:23,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012033496] [2020-02-10 20:17:23,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:23,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012033496] [2020-02-10 20:17:23,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:23,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:23,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704987141] [2020-02-10 20:17:23,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:23,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:23,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:23,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:23,569 INFO L87 Difference]: Start difference. First operand 1572 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:17:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:23,788 INFO L93 Difference]: Finished difference Result 2898 states and 11599 transitions. [2020-02-10 20:17:23,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:23,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:23,796 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:17:23,796 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:17:23,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:17:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1567. [2020-02-10 20:17:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:17:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7041 transitions. [2020-02-10 20:17:23,860 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7041 transitions. Word has length 28 [2020-02-10 20:17:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:23,860 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7041 transitions. [2020-02-10 20:17:23,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7041 transitions. [2020-02-10 20:17:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:23,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:23,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:23,862 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash -728120924, now seen corresponding path program 369 times [2020-02-10 20:17:23,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:23,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616230331] [2020-02-10 20:17:23,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:24,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616230331] [2020-02-10 20:17:24,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:24,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:24,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335960414] [2020-02-10 20:17:24,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:24,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:24,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:24,382 INFO L87 Difference]: Start difference. First operand 1567 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:17:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:24,594 INFO L93 Difference]: Finished difference Result 2894 states and 11591 transitions. [2020-02-10 20:17:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:24,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:24,602 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 20:17:24,602 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 20:17:24,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 20:17:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1571. [2020-02-10 20:17:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:17:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7048 transitions. [2020-02-10 20:17:24,689 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7048 transitions. Word has length 28 [2020-02-10 20:17:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:24,689 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7048 transitions. [2020-02-10 20:17:24,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7048 transitions. [2020-02-10 20:17:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:24,691 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:24,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:24,691 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:24,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash -554873232, now seen corresponding path program 370 times [2020-02-10 20:17:24,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:24,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342247113] [2020-02-10 20:17:24,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:25,214 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:17:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:25,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342247113] [2020-02-10 20:17:25,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:25,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:25,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623958509] [2020-02-10 20:17:25,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:25,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:25,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:25,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:25,223 INFO L87 Difference]: Start difference. First operand 1571 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:17:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:25,437 INFO L93 Difference]: Finished difference Result 2893 states and 11585 transitions. [2020-02-10 20:17:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:25,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:25,444 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:17:25,444 INFO L226 Difference]: Without dead ends: 2875 [2020-02-10 20:17:25,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2020-02-10 20:17:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 1567. [2020-02-10 20:17:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:17:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7037 transitions. [2020-02-10 20:17:25,507 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7037 transitions. Word has length 28 [2020-02-10 20:17:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:25,507 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7037 transitions. [2020-02-10 20:17:25,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7037 transitions. [2020-02-10 20:17:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:25,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:25,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:25,510 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1627522532, now seen corresponding path program 371 times [2020-02-10 20:17:25,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:25,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379505216] [2020-02-10 20:17:25,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:26,027 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:17:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:26,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379505216] [2020-02-10 20:17:26,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:26,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:26,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013375506] [2020-02-10 20:17:26,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:26,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:26,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:26,037 INFO L87 Difference]: Start difference. First operand 1567 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:17:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:26,245 INFO L93 Difference]: Finished difference Result 2896 states and 11591 transitions. [2020-02-10 20:17:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:26,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:26,253 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:17:26,253 INFO L226 Difference]: Without dead ends: 2880 [2020-02-10 20:17:26,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-02-10 20:17:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 1571. [2020-02-10 20:17:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:17:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7044 transitions. [2020-02-10 20:17:26,316 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7044 transitions. Word has length 28 [2020-02-10 20:17:26,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:26,316 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7044 transitions. [2020-02-10 20:17:26,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7044 transitions. [2020-02-10 20:17:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:26,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:26,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, 1, 1, 1] [2020-02-10 20:17:26,319 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:26,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:26,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1056067726, now seen corresponding path program 372 times [2020-02-10 20:17:26,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:26,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627962120] [2020-02-10 20:17:26,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:26,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627962120] [2020-02-10 20:17:26,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:26,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:26,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069238171] [2020-02-10 20:17:26,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:26,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:26,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:26,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:26,841 INFO L87 Difference]: Start difference. First operand 1571 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:17:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:27,030 INFO L93 Difference]: Finished difference Result 2894 states and 11583 transitions. [2020-02-10 20:17:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:27,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:27,038 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 20:17:27,038 INFO L226 Difference]: Without dead ends: 2872 [2020-02-10 20:17:27,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2020-02-10 20:17:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 1563. [2020-02-10 20:17:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:17:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7026 transitions. [2020-02-10 20:17:27,101 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7026 transitions. Word has length 28 [2020-02-10 20:17:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:27,101 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7026 transitions. [2020-02-10 20:17:27,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7026 transitions. [2020-02-10 20:17:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:27,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:27,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, 1, 1, 1] [2020-02-10 20:17:27,104 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash -171884914, now seen corresponding path program 373 times [2020-02-10 20:17:27,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:27,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568986633] [2020-02-10 20:17:27,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:27,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568986633] [2020-02-10 20:17:27,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:27,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:27,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793473714] [2020-02-10 20:17:27,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:27,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:27,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:27,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:27,632 INFO L87 Difference]: Start difference. First operand 1563 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:17:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:27,812 INFO L93 Difference]: Finished difference Result 2901 states and 11606 transitions. [2020-02-10 20:17:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:27,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:27,820 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 20:17:27,820 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:17:27,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:17:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1572. [2020-02-10 20:17:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:17:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7050 transitions. [2020-02-10 20:17:27,884 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7050 transitions. Word has length 28 [2020-02-10 20:17:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:27,884 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7050 transitions. [2020-02-10 20:17:27,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7050 transitions. [2020-02-10 20:17:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:27,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:27,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, 1, 1, 1] [2020-02-10 20:17:27,886 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:27,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2062222580, now seen corresponding path program 374 times [2020-02-10 20:17:27,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:27,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910523842] [2020-02-10 20:17:27,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:28,405 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:17:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:28,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910523842] [2020-02-10 20:17:28,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:28,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:28,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607064175] [2020-02-10 20:17:28,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:28,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:28,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:28,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:28,413 INFO L87 Difference]: Start difference. First operand 1572 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:17:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:28,628 INFO L93 Difference]: Finished difference Result 2904 states and 11607 transitions. [2020-02-10 20:17:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:28,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:28,636 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:17:28,636 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:17:28,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:17:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1567. [2020-02-10 20:17:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:17:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7037 transitions. [2020-02-10 20:17:28,699 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7037 transitions. Word has length 28 [2020-02-10 20:17:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:28,699 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7037 transitions. [2020-02-10 20:17:28,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7037 transitions. [2020-02-10 20:17:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:28,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:28,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:28,702 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash 365970664, now seen corresponding path program 375 times [2020-02-10 20:17:28,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:28,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340006402] [2020-02-10 20:17:28,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:29,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340006402] [2020-02-10 20:17:29,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:29,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:29,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150261051] [2020-02-10 20:17:29,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:29,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:29,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:29,237 INFO L87 Difference]: Start difference. First operand 1567 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:17:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:29,438 INFO L93 Difference]: Finished difference Result 2896 states and 11591 transitions. [2020-02-10 20:17:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:29,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:29,446 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:17:29,446 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:17:29,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:17:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1571. [2020-02-10 20:17:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:17:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7044 transitions. [2020-02-10 20:17:29,509 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7044 transitions. Word has length 28 [2020-02-10 20:17:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:29,510 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7044 transitions. [2020-02-10 20:17:29,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7044 transitions. [2020-02-10 20:17:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:29,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:29,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:29,513 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:29,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash 539218356, now seen corresponding path program 376 times [2020-02-10 20:17:29,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:29,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363398778] [2020-02-10 20:17:29,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:30,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363398778] [2020-02-10 20:17:30,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:30,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:30,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675553330] [2020-02-10 20:17:30,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:30,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:30,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:30,069 INFO L87 Difference]: Start difference. First operand 1571 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:17:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:30,258 INFO L93 Difference]: Finished difference Result 2895 states and 11585 transitions. [2020-02-10 20:17:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:30,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:30,265 INFO L225 Difference]: With dead ends: 2895 [2020-02-10 20:17:30,265 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:17:30,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:17:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1567. [2020-02-10 20:17:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:17:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 20:17:30,333 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 20:17:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:30,333 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 20:17:30,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 20:17:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:30,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:30,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:30,336 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1157033560, now seen corresponding path program 377 times [2020-02-10 20:17:30,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:30,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178108535] [2020-02-10 20:17:30,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:30,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-02-10 20:17:30,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178108535] [2020-02-10 20:17:30,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:30,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:30,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940087286] [2020-02-10 20:17:30,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:30,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:30,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:30,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:30,854 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:17:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:31,066 INFO L93 Difference]: Finished difference Result 2902 states and 11599 transitions. [2020-02-10 20:17:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:31,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:31,074 INFO L225 Difference]: With dead ends: 2902 [2020-02-10 20:17:31,075 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:17:31,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:17:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1571. [2020-02-10 20:17:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:17:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:17:31,138 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:17:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:31,138 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:17:31,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:17:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:31,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:31,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:31,140 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:31,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1077073934, now seen corresponding path program 378 times [2020-02-10 20:17:31,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:31,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514498508] [2020-02-10 20:17:31,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:31,601 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:17:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:31,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514498508] [2020-02-10 20:17:31,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:31,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:31,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297227280] [2020-02-10 20:17:31,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:31,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:31,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:31,728 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:17:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:31,978 INFO L93 Difference]: Finished difference Result 2898 states and 11587 transitions. [2020-02-10 20:17:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:31,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:31,986 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:17:31,986 INFO L226 Difference]: Without dead ends: 2876 [2020-02-10 20:17:31,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2020-02-10 20:17:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 1563. [2020-02-10 20:17:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:17:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7022 transitions. [2020-02-10 20:17:32,052 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7022 transitions. Word has length 28 [2020-02-10 20:17:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:32,053 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7022 transitions. [2020-02-10 20:17:32,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7022 transitions. [2020-02-10 20:17:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:32,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:32,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, 1, 1, 1] [2020-02-10 20:17:32,055 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:32,055 INFO L82 PathProgramCache]: Analyzing trace with hash 583320688, now seen corresponding path program 379 times [2020-02-10 20:17:32,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:32,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393972873] [2020-02-10 20:17:32,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:32,560 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:17:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:32,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393972873] [2020-02-10 20:17:32,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:32,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:32,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931796149] [2020-02-10 20:17:32,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:32,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:32,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:32,567 INFO L87 Difference]: Start difference. First operand 1563 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:17:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:32,835 INFO L93 Difference]: Finished difference Result 2906 states and 11614 transitions. [2020-02-10 20:17:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:32,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:32,843 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:17:32,843 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:17:32,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:17:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1573. [2020-02-10 20:17:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:17:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7048 transitions. [2020-02-10 20:17:32,908 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7048 transitions. Word has length 28 [2020-02-10 20:17:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:32,908 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7048 transitions. [2020-02-10 20:17:32,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7048 transitions. [2020-02-10 20:17:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:32,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:32,910 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:32,911 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:32,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2072725684, now seen corresponding path program 380 times [2020-02-10 20:17:32,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:32,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020674431] [2020-02-10 20:17:32,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:33,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020674431] [2020-02-10 20:17:33,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:33,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:33,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240490673] [2020-02-10 20:17:33,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:33,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:33,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:33,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:33,429 INFO L87 Difference]: Start difference. First operand 1573 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:17:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:33,692 INFO L93 Difference]: Finished difference Result 2908 states and 11612 transitions. [2020-02-10 20:17:33,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:33,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:33,700 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:17:33,700 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:17:33,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:33,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:17:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1567. [2020-02-10 20:17:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:17:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 20:17:33,763 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 20:17:33,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:33,763 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 20:17:33,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 20:17:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:33,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:33,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:33,765 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:33,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1121176266, now seen corresponding path program 381 times [2020-02-10 20:17:33,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:33,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179678278] [2020-02-10 20:17:33,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:34,281 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:17:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:34,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179678278] [2020-02-10 20:17:34,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:34,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:34,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531616160] [2020-02-10 20:17:34,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:34,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:34,289 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:17:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:34,487 INFO L93 Difference]: Finished difference Result 2900 states and 11596 transitions. [2020-02-10 20:17:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:34,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:34,495 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 20:17:34,495 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:17:34,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:17:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1571. [2020-02-10 20:17:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:17:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:17:34,559 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:17:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:34,560 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:17:34,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:17:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:34,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:34,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:34,562 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:34,562 INFO L82 PathProgramCache]: Analyzing trace with hash 549721460, now seen corresponding path program 382 times [2020-02-10 20:17:34,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:34,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987308424] [2020-02-10 20:17:34,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:34,984 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2020-02-10 20:17:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:35,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987308424] [2020-02-10 20:17:35,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:35,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:35,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051820119] [2020-02-10 20:17:35,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:35,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:35,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:35,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:35,105 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:17:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:35,374 INFO L93 Difference]: Finished difference Result 2898 states and 11588 transitions. [2020-02-10 20:17:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:35,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:35,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:35,381 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:17:35,381 INFO L226 Difference]: Without dead ends: 2880 [2020-02-10 20:17:35,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-02-10 20:17:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 1567. [2020-02-10 20:17:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:17:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 20:17:35,446 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 20:17:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:35,447 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 20:17:35,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 20:17:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:35,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:35,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:35,449 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1537495882, now seen corresponding path program 383 times [2020-02-10 20:17:35,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:35,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34582853] [2020-02-10 20:17:35,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:35,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34582853] [2020-02-10 20:17:35,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:35,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:35,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920557779] [2020-02-10 20:17:35,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:35,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:35,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:35,980 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:17:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:36,248 INFO L93 Difference]: Finished difference Result 2904 states and 11600 transitions. [2020-02-10 20:17:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:36,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:36,256 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:17:36,256 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:17:36,257 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:17:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1571. [2020-02-10 20:17:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:17:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:17:36,323 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:17:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:36,323 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:17:36,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:17:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:36,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:36,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:36,326 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:36,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash -523363920, now seen corresponding path program 384 times [2020-02-10 20:17:36,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:36,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804931161] [2020-02-10 20:17:36,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17: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-02-10 20:17:36,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804931161] [2020-02-10 20:17:36,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:36,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:36,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492315295] [2020-02-10 20:17:36,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:36,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:36,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:36,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:36,847 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:17:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:37,059 INFO L93 Difference]: Finished difference Result 2900 states and 11588 transitions. [2020-02-10 20:17:37,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:37,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:37,067 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 20:17:37,067 INFO L226 Difference]: Without dead ends: 2874 [2020-02-10 20:17:37,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2020-02-10 20:17:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 1559. [2020-02-10 20:17:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 20:17:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 7011 transitions. [2020-02-10 20:17:37,131 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 7011 transitions. Word has length 28 [2020-02-10 20:17:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:37,131 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 7011 transitions. [2020-02-10 20:17:37,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 7011 transitions. [2020-02-10 20:17:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:37,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:37,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:37,134 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:37,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:37,134 INFO L82 PathProgramCache]: Analyzing trace with hash -129443996, now seen corresponding path program 385 times [2020-02-10 20:17:37,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:37,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056690961] [2020-02-10 20:17:37,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:37,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056690961] [2020-02-10 20:17:37,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:37,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:37,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274720486] [2020-02-10 20:17:37,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:37,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:37,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:37,672 INFO L87 Difference]: Start difference. First operand 1559 states and 7011 transitions. Second operand 11 states. [2020-02-10 20:17:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:37,882 INFO L93 Difference]: Finished difference Result 2919 states and 11668 transitions. [2020-02-10 20:17:37,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:37,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:37,890 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:17:37,890 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:17:37,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:17:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1574. [2020-02-10 20:17:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:17:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7063 transitions. [2020-02-10 20:17:37,955 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7063 transitions. Word has length 28 [2020-02-10 20:17:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:37,955 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7063 transitions. [2020-02-10 20:17:37,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7063 transitions. [2020-02-10 20:17:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:37,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:37,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:37,958 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:37,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:37,958 INFO L82 PathProgramCache]: Analyzing trace with hash 615258502, now seen corresponding path program 386 times [2020-02-10 20:17:37,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:37,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006518913] [2020-02-10 20:17:37,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:38,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006518913] [2020-02-10 20:17:38,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:38,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:38,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903817157] [2020-02-10 20:17:38,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:38,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:38,491 INFO L87 Difference]: Start difference. First operand 1574 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:17:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:38,705 INFO L93 Difference]: Finished difference Result 2920 states and 11665 transitions. [2020-02-10 20:17:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:38,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:38,713 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:17:38,713 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:17:38,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:17:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1569. [2020-02-10 20:17:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:17:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7049 transitions. [2020-02-10 20:17:38,777 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7049 transitions. Word has length 28 [2020-02-10 20:17:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:38,777 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7049 transitions. [2020-02-10 20:17:38,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7049 transitions. [2020-02-10 20:17:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:38,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:38,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:38,780 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1202529376, now seen corresponding path program 387 times [2020-02-10 20:17:38,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:38,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955090135] [2020-02-10 20:17:38,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:39,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955090135] [2020-02-10 20:17:39,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:39,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:39,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431831426] [2020-02-10 20:17:39,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:39,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:39,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:39,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:39,316 INFO L87 Difference]: Start difference. First operand 1569 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:17:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:39,584 INFO L93 Difference]: Finished difference Result 2921 states and 11667 transitions. [2020-02-10 20:17:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:39,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:39,591 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:17:39,592 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:17:39,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:17:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1574. [2020-02-10 20:17:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:17:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7058 transitions. [2020-02-10 20:17:39,657 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7058 transitions. Word has length 28 [2020-02-10 20:17:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:39,657 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7058 transitions. [2020-02-10 20:17:39,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7058 transitions. [2020-02-10 20:17:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:39,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:39,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:39,660 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1031578118, now seen corresponding path program 388 times [2020-02-10 20:17:39,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:39,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040602516] [2020-02-10 20:17:39,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:40,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040602516] [2020-02-10 20:17:40,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:40,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:40,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970489085] [2020-02-10 20:17:40,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:40,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:40,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:40,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:40,180 INFO L87 Difference]: Start difference. First operand 1574 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:17:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:40,457 INFO L93 Difference]: Finished difference Result 2924 states and 11668 transitions. [2020-02-10 20:17:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:40,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:40,464 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:17:40,464 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:17:40,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:17:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1569. [2020-02-10 20:17:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:17:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7044 transitions. [2020-02-10 20:17:40,528 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7044 transitions. Word has length 28 [2020-02-10 20:17:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:40,528 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7044 transitions. [2020-02-10 20:17:40,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7044 transitions. [2020-02-10 20:17:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:40,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:40,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:40,530 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1153114080, now seen corresponding path program 389 times [2020-02-10 20:17:40,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:40,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018171745] [2020-02-10 20:17:40,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:41,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018171745] [2020-02-10 20:17:41,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:41,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:41,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626598033] [2020-02-10 20:17:41,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:41,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:41,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:41,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:41,037 INFO L87 Difference]: Start difference. First operand 1569 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:17:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:41,208 INFO L93 Difference]: Finished difference Result 2924 states and 11669 transitions. [2020-02-10 20:17:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:41,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:41,216 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:17:41,216 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:17:41,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:17:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1575. [2020-02-10 20:17:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:17:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7055 transitions. [2020-02-10 20:17:41,279 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7055 transitions. Word has length 28 [2020-02-10 20:17:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:41,279 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7055 transitions. [2020-02-10 20:17:41,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7055 transitions. [2020-02-10 20:17:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:41,282 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:41,282 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:41,282 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:41,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:41,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1652448220, now seen corresponding path program 390 times [2020-02-10 20:17:41,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:41,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382859923] [2020-02-10 20:17:41,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:41,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382859923] [2020-02-10 20:17:41,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:41,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:41,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820561025] [2020-02-10 20:17:41,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:41,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:41,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:41,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:41,810 INFO L87 Difference]: Start difference. First operand 1575 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:17:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:41,981 INFO L93 Difference]: Finished difference Result 2926 states and 11667 transitions. [2020-02-10 20:17:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:41,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:41,989 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 20:17:41,989 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 20:17:41,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 20:17:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1564. [2020-02-10 20:17:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:17:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7030 transitions. [2020-02-10 20:17:42,057 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7030 transitions. Word has length 28 [2020-02-10 20:17:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:42,057 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7030 transitions. [2020-02-10 20:17:42,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7030 transitions. [2020-02-10 20:17:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:42,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:42,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:42,060 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:42,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:42,060 INFO L82 PathProgramCache]: Analyzing trace with hash 458301326, now seen corresponding path program 391 times [2020-02-10 20:17:42,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:42,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586406892] [2020-02-10 20:17:42,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:42,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586406892] [2020-02-10 20:17:42,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:42,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:42,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010414311] [2020-02-10 20:17:42,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:42,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:42,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:42,591 INFO L87 Difference]: Start difference. First operand 1564 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:17:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:42,764 INFO L93 Difference]: Finished difference Result 2918 states and 11661 transitions. [2020-02-10 20:17:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:42,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:42,772 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 20:17:42,772 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:17:42,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:17:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1574. [2020-02-10 20:17:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:17:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7058 transitions. [2020-02-10 20:17:42,836 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7058 transitions. Word has length 28 [2020-02-10 20:17:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:42,836 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7058 transitions. [2020-02-10 20:17:42,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7058 transitions. [2020-02-10 20:17:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:42,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:42,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:42,838 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1203003824, now seen corresponding path program 392 times [2020-02-10 20:17:42,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:42,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078155200] [2020-02-10 20:17:42,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:43,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078155200] [2020-02-10 20:17:43,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:43,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:43,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162947971] [2020-02-10 20:17:43,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:43,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:43,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:43,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:43,379 INFO L87 Difference]: Start difference. First operand 1574 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:17:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:43,551 INFO L93 Difference]: Finished difference Result 2919 states and 11658 transitions. [2020-02-10 20:17:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:43,551 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:43,559 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:17:43,559 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:17:43,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:17:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1569. [2020-02-10 20:17:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:17:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7044 transitions. [2020-02-10 20:17:43,622 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7044 transitions. Word has length 28 [2020-02-10 20:17:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:43,622 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7044 transitions. [2020-02-10 20:17:43,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7044 transitions. [2020-02-10 20:17:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:43,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:43,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:43,624 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1150013856, now seen corresponding path program 393 times [2020-02-10 20:17:43,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:43,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509020920] [2020-02-10 20:17:43,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:44,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509020920] [2020-02-10 20:17:44,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:44,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:44,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048057917] [2020-02-10 20:17:44,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:44,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:44,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:44,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:44,155 INFO L87 Difference]: Start difference. First operand 1569 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:17:44,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:44,330 INFO L93 Difference]: Finished difference Result 2919 states and 11658 transitions. [2020-02-10 20:17:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:44,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:44,338 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:17:44,338 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:17:44,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:17:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1574. [2020-02-10 20:17:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:17:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7053 transitions. [2020-02-10 20:17:44,401 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7053 transitions. Word has length 28 [2020-02-10 20:17:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:44,401 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7053 transitions. [2020-02-10 20:17:44,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7053 transitions. [2020-02-10 20:17:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:44,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:44,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, 1, 1, 1] [2020-02-10 20:17:44,404 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:44,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:44,404 INFO L82 PathProgramCache]: Analyzing trace with hash 512638832, now seen corresponding path program 394 times [2020-02-10 20:17:44,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:44,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868834840] [2020-02-10 20:17:44,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:44,924 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:17:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:44,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868834840] [2020-02-10 20:17:44,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:44,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:44,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310760478] [2020-02-10 20:17:44,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:44,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:44,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:44,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:44,932 INFO L87 Difference]: Start difference. First operand 1574 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:17:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:45,120 INFO L93 Difference]: Finished difference Result 2921 states and 11657 transitions. [2020-02-10 20:17:45,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:45,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:45,128 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:17:45,128 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:17:45,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:17:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1569. [2020-02-10 20:17:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:17:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7039 transitions. [2020-02-10 20:17:45,217 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7039 transitions. Word has length 28 [2020-02-10 20:17:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:45,217 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7039 transitions. [2020-02-10 20:17:45,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7039 transitions. [2020-02-10 20:17:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:45,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:45,220 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:45,220 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1205629600, now seen corresponding path program 395 times [2020-02-10 20:17:45,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:45,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903685766] [2020-02-10 20:17:45,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:45,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903685766] [2020-02-10 20:17:45,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:45,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:45,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256016695] [2020-02-10 20:17:45,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:45,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:45,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:45,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:45,740 INFO L87 Difference]: Start difference. First operand 1569 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:17:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:45,916 INFO L93 Difference]: Finished difference Result 2922 states and 11660 transitions. [2020-02-10 20:17:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:45,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:45,924 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:17:45,924 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:17:45,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:17:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1575. [2020-02-10 20:17:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:17:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7050 transitions. [2020-02-10 20:17:45,988 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7050 transitions. Word has length 28 [2020-02-10 20:17:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:45,989 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7050 transitions. [2020-02-10 20:17:45,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:45,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7050 transitions. [2020-02-10 20:17:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:45,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:45,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:45,991 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2123579790, now seen corresponding path program 396 times [2020-02-10 20:17:45,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:45,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63380149] [2020-02-10 20:17:45,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:46,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63380149] [2020-02-10 20:17:46,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:46,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:46,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102262420] [2020-02-10 20:17:46,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:46,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:46,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:46,530 INFO L87 Difference]: Start difference. First operand 1575 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:17:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:46,729 INFO L93 Difference]: Finished difference Result 2923 states and 11656 transitions. [2020-02-10 20:17:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:46,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:46,736 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:17:46,736 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:17:46,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:17:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1564. [2020-02-10 20:17:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:17:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7025 transitions. [2020-02-10 20:17:46,801 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7025 transitions. Word has length 28 [2020-02-10 20:17:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:46,801 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7025 transitions. [2020-02-10 20:17:46,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7025 transitions. [2020-02-10 20:17:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:46,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:46,804 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:46,804 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:46,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:46,804 INFO L82 PathProgramCache]: Analyzing trace with hash 479307534, now seen corresponding path program 397 times [2020-02-10 20:17:46,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:46,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284946455] [2020-02-10 20:17:46,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:47,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284946455] [2020-02-10 20:17:47,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:47,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:47,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934215569] [2020-02-10 20:17:47,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:47,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:47,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:47,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:47,332 INFO L87 Difference]: Start difference. First operand 1564 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:17:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:47,529 INFO L93 Difference]: Finished difference Result 2923 states and 11667 transitions. [2020-02-10 20:17:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:47,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:47,537 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:17:47,537 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:17:47,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:17:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1574. [2020-02-10 20:17:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:17:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7053 transitions. [2020-02-10 20:17:47,601 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7053 transitions. Word has length 28 [2020-02-10 20:17:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:47,601 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7053 transitions. [2020-02-10 20:17:47,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7053 transitions. [2020-02-10 20:17:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:47,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:47,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:47,603 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1581552268, now seen corresponding path program 398 times [2020-02-10 20:17:47,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:47,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746376517] [2020-02-10 20:17:47,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:48,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746376517] [2020-02-10 20:17:48,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:48,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:48,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393046448] [2020-02-10 20:17:48,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:48,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:48,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:48,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:48,122 INFO L87 Difference]: Start difference. First operand 1574 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:17:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:48,297 INFO L93 Difference]: Finished difference Result 2926 states and 11668 transitions. [2020-02-10 20:17:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:48,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:48,305 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 20:17:48,305 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:17:48,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:17:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1569. [2020-02-10 20:17:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:17:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7039 transitions. [2020-02-10 20:17:48,369 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7039 transitions. Word has length 28 [2020-02-10 20:17:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:48,369 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7039 transitions. [2020-02-10 20:17:48,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7039 transitions. [2020-02-10 20:17:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:48,371 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:48,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, 1, 1, 1] [2020-02-10 20:17:48,371 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash -55922268, now seen corresponding path program 399 times [2020-02-10 20:17:48,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:48,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427440752] [2020-02-10 20:17:48,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:48,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427440752] [2020-02-10 20:17:48,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:48,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:48,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254857003] [2020-02-10 20:17:48,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:48,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:48,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:48,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:48,891 INFO L87 Difference]: Start difference. First operand 1569 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:17:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:49,085 INFO L93 Difference]: Finished difference Result 2922 states and 11660 transitions. [2020-02-10 20:17:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:49,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:49,092 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:17:49,092 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:17:49,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:17:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1574. [2020-02-10 20:17:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:17:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7048 transitions. [2020-02-10 20:17:49,155 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7048 transitions. Word has length 28 [2020-02-10 20:17:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:49,156 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7048 transitions. [2020-02-10 20:17:49,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7048 transitions. [2020-02-10 20:17:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:49,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:49,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:49,158 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:49,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1606730420, now seen corresponding path program 400 times [2020-02-10 20:17:49,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:49,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149404044] [2020-02-10 20:17:49,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:49,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149404044] [2020-02-10 20:17:49,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:49,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:49,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622859343] [2020-02-10 20:17:49,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:49,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:49,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:49,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:49,690 INFO L87 Difference]: Start difference. First operand 1574 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:17:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:49,877 INFO L93 Difference]: Finished difference Result 2924 states and 11659 transitions. [2020-02-10 20:17:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:49,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:49,884 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:17:49,884 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 20:17:49,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 20:17:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1569. [2020-02-10 20:17:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:17:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7034 transitions. [2020-02-10 20:17:49,948 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7034 transitions. Word has length 28 [2020-02-10 20:17:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:49,948 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7034 transitions. [2020-02-10 20:17:49,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7034 transitions. [2020-02-10 20:17:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:49,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:49,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:49,950 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:49,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:49,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1578926492, now seen corresponding path program 401 times [2020-02-10 20:17:49,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:49,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968104951] [2020-02-10 20:17:49,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:50,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968104951] [2020-02-10 20:17:50,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:50,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:50,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165070857] [2020-02-10 20:17:50,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:50,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:50,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:50,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:50,507 INFO L87 Difference]: Start difference. First operand 1569 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:17:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:50,718 INFO L93 Difference]: Finished difference Result 2930 states and 11673 transitions. [2020-02-10 20:17:50,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:50,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:50,726 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:17:50,726 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:17:50,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:17:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1576. [2020-02-10 20:17:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:17:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7047 transitions. [2020-02-10 20:17:50,791 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7047 transitions. Word has length 28 [2020-02-10 20:17:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:50,791 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7047 transitions. [2020-02-10 20:17:50,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7047 transitions. [2020-02-10 20:17:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:50,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:50,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:50,793 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2144585998, now seen corresponding path program 402 times [2020-02-10 20:17:50,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:50,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650815846] [2020-02-10 20:17:50,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:51,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650815846] [2020-02-10 20:17:51,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:51,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:51,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080045769] [2020-02-10 20:17:51,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:51,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:51,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:51,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:51,319 INFO L87 Difference]: Start difference. First operand 1576 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:17:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:51,492 INFO L93 Difference]: Finished difference Result 2929 states and 11664 transitions. [2020-02-10 20:17:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:51,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:51,500 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:17:51,500 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:17:51,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:17:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1564. [2020-02-10 20:17:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:17:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7020 transitions. [2020-02-10 20:17:51,563 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7020 transitions. Word has length 28 [2020-02-10 20:17:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:51,564 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7020 transitions. [2020-02-10 20:17:51,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7020 transitions. [2020-02-10 20:17:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:51,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:51,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:51,566 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:51,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1234513136, now seen corresponding path program 403 times [2020-02-10 20:17:51,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:51,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944876907] [2020-02-10 20:17:51,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:52,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944876907] [2020-02-10 20:17:52,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:52,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:52,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175106533] [2020-02-10 20:17:52,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:52,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:52,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:52,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:52,091 INFO L87 Difference]: Start difference. First operand 1564 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:17:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:52,278 INFO L93 Difference]: Finished difference Result 2930 states and 11681 transitions. [2020-02-10 20:17:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:52,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:52,286 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:17:52,286 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:17:52,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:17:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1576. [2020-02-10 20:17:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:17:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 20:17:52,349 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 20:17:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:52,350 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 20:17:52,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 20:17:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:52,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:52,352 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:52,352 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1571049164, now seen corresponding path program 404 times [2020-02-10 20:17:52,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:52,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309028615] [2020-02-10 20:17:52,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:52,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309028615] [2020-02-10 20:17:52,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:52,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:52,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782904056] [2020-02-10 20:17:52,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:52,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:52,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:52,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:52,885 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:17:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:53,084 INFO L93 Difference]: Finished difference Result 2932 states and 11679 transitions. [2020-02-10 20:17:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:53,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:53,092 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:17:53,092 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:17:53,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:17:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1570. [2020-02-10 20:17:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:17:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7037 transitions. [2020-02-10 20:17:53,155 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7037 transitions. Word has length 28 [2020-02-10 20:17:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:53,155 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7037 transitions. [2020-02-10 20:17:53,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7037 transitions. [2020-02-10 20:17:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:53,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:53,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:53,158 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:53,158 INFO L82 PathProgramCache]: Analyzing trace with hash 699283334, now seen corresponding path program 405 times [2020-02-10 20:17:53,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:53,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63997172] [2020-02-10 20:17:53,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:53,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63997172] [2020-02-10 20:17:53,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:53,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:53,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883632178] [2020-02-10 20:17:53,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:53,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:53,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:53,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:53,696 INFO L87 Difference]: Start difference. First operand 1570 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:17:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:53,866 INFO L93 Difference]: Finished difference Result 2929 states and 11673 transitions. [2020-02-10 20:17:53,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:53,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:53,874 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:17:53,874 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:17:53,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:17:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1576. [2020-02-10 20:17:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:17:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7048 transitions. [2020-02-10 20:17:53,938 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7048 transitions. Word has length 28 [2020-02-10 20:17:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:53,938 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7048 transitions. [2020-02-10 20:17:53,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7048 transitions. [2020-02-10 20:17:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:53,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:53,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:53,941 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:53,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1617233524, now seen corresponding path program 406 times [2020-02-10 20:17:53,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:53,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532231964] [2020-02-10 20:17:53,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:54,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532231964] [2020-02-10 20:17:54,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:54,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:54,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908361138] [2020-02-10 20:17:54,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:54,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:54,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:54,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:54,480 INFO L87 Difference]: Start difference. First operand 1576 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:17:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:54,655 INFO L93 Difference]: Finished difference Result 2930 states and 11669 transitions. [2020-02-10 20:17:54,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:54,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:54,663 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:17:54,663 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:17:54,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:17:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1570. [2020-02-10 20:17:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:17:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7031 transitions. [2020-02-10 20:17:54,727 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7031 transitions. Word has length 28 [2020-02-10 20:17:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:54,727 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7031 transitions. [2020-02-10 20:17:54,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7031 transitions. [2020-02-10 20:17:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:54,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:54,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, 1, 1, 1] [2020-02-10 20:17:54,729 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:54,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:54,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1115602950, now seen corresponding path program 407 times [2020-02-10 20:17:54,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:54,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206790780] [2020-02-10 20:17:54,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:55,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206790780] [2020-02-10 20:17:55,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:55,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:55,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208837084] [2020-02-10 20:17:55,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:55,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:55,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:55,266 INFO L87 Difference]: Start difference. First operand 1570 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:17:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:55,457 INFO L93 Difference]: Finished difference Result 2934 states and 11678 transitions. [2020-02-10 20:17:55,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:55,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:55,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:55,465 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:17:55,465 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:17:55,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:17:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1577. [2020-02-10 20:17:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:17:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7044 transitions. [2020-02-10 20:17:55,531 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7044 transitions. Word has length 28 [2020-02-10 20:17:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:55,531 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7044 transitions. [2020-02-10 20:17:55,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7044 transitions. [2020-02-10 20:17:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:55,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:55,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:55,534 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 544148144, now seen corresponding path program 408 times [2020-02-10 20:17:55,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:55,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729826128] [2020-02-10 20:17:55,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:56,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729826128] [2020-02-10 20:17:56,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:56,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:56,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074688054] [2020-02-10 20:17:56,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:56,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:56,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:56,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:56,066 INFO L87 Difference]: Start difference. First operand 1577 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:17:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:56,243 INFO L93 Difference]: Finished difference Result 2933 states and 11669 transitions. [2020-02-10 20:17:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:56,244 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:56,251 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:17:56,251 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:17:56,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:17:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1559. [2020-02-10 20:17:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 20:17:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 7007 transitions. [2020-02-10 20:17:56,314 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 7007 transitions. Word has length 28 [2020-02-10 20:17:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:56,315 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 7007 transitions. [2020-02-10 20:17:56,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 7007 transitions. [2020-02-10 20:17:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:56,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:56,317 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:56,317 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:56,317 INFO L82 PathProgramCache]: Analyzing trace with hash 847344676, now seen corresponding path program 409 times [2020-02-10 20:17:56,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:56,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456053708] [2020-02-10 20:17:56,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:56,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456053708] [2020-02-10 20:17:56,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:56,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:56,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592850999] [2020-02-10 20:17:56,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:56,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:56,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:56,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:56,849 INFO L87 Difference]: Start difference. First operand 1559 states and 7007 transitions. Second operand 11 states. [2020-02-10 20:17:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:57,029 INFO L93 Difference]: Finished difference Result 2896 states and 11596 transitions. [2020-02-10 20:17:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:57,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:57,036 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:17:57,037 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:17:57,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:17:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1572. [2020-02-10 20:17:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:17:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7050 transitions. [2020-02-10 20:17:57,100 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7050 transitions. Word has length 28 [2020-02-10 20:17:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:57,100 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7050 transitions. [2020-02-10 20:17:57,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7050 transitions. [2020-02-10 20:17:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:57,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:57,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, 1, 1, 1] [2020-02-10 20:17:57,102 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1592047174, now seen corresponding path program 410 times [2020-02-10 20:17:57,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:57,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488163578] [2020-02-10 20:17:57,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:57,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488163578] [2020-02-10 20:17:57,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:57,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:57,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743632268] [2020-02-10 20:17:57,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:57,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:57,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:57,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:57,640 INFO L87 Difference]: Start difference. First operand 1572 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:17:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:57,835 INFO L93 Difference]: Finished difference Result 2897 states and 11593 transitions. [2020-02-10 20:17:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:57,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:57,842 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:17:57,843 INFO L226 Difference]: Without dead ends: 2876 [2020-02-10 20:17:57,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2020-02-10 20:17:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 1567. [2020-02-10 20:17:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:17:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7037 transitions. [2020-02-10 20:17:57,905 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7037 transitions. Word has length 28 [2020-02-10 20:17:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:57,906 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7037 transitions. [2020-02-10 20:17:57,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7037 transitions. [2020-02-10 20:17:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:57,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:57,908 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:57,908 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:57,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:57,908 INFO L82 PathProgramCache]: Analyzing trace with hash 312114874, now seen corresponding path program 411 times [2020-02-10 20:17:57,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:57,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261426597] [2020-02-10 20:17:57,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:58,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261426597] [2020-02-10 20:17:58,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:58,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:58,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052757688] [2020-02-10 20:17:58,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:58,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:58,444 INFO L87 Difference]: Start difference. First operand 1567 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:17:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:58,654 INFO L93 Difference]: Finished difference Result 2893 states and 11585 transitions. [2020-02-10 20:17:58,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:58,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:58,662 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:17:58,662 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:17:58,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:17:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1571. [2020-02-10 20:17:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:17:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7044 transitions. [2020-02-10 20:17:58,725 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7044 transitions. Word has length 28 [2020-02-10 20:17:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:58,726 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7044 transitions. [2020-02-10 20:17:58,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7044 transitions. [2020-02-10 20:17:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:58,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:58,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:58,728 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash 485362566, now seen corresponding path program 412 times [2020-02-10 20:17:58,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:58,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903794006] [2020-02-10 20:17:58,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:59,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903794006] [2020-02-10 20:17:59,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:59,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:17:59,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405536920] [2020-02-10 20:17:59,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:17:59,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:59,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:17:59,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:59,267 INFO L87 Difference]: Start difference. First operand 1571 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:17:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:59,478 INFO L93 Difference]: Finished difference Result 2892 states and 11579 transitions. [2020-02-10 20:17:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:17:59,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:17:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:59,486 INFO L225 Difference]: With dead ends: 2892 [2020-02-10 20:17:59,486 INFO L226 Difference]: Without dead ends: 2874 [2020-02-10 20:17:59,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:17:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2020-02-10 20:17:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 1567. [2020-02-10 20:17:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:17:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 20:17:59,550 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 20:17:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:59,550 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 20:17:59,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:17:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 20:17:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:17:59,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:59,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:59,552 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1627208966, now seen corresponding path program 413 times [2020-02-10 20:17:59,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:59,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535002562] [2020-02-10 20:17:59,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:00,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535002562] [2020-02-10 20:18:00,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:00,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:00,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002738046] [2020-02-10 20:18:00,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:00,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:00,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:00,083 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:18:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:00,259 INFO L93 Difference]: Finished difference Result 2895 states and 11585 transitions. [2020-02-10 20:18:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:00,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:00,267 INFO L225 Difference]: With dead ends: 2895 [2020-02-10 20:18:00,268 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 20:18:00,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 20:18:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1571. [2020-02-10 20:18:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:18:00,331 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:18:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:00,331 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:18:00,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:18:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:00,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:00,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, 1, 1, 1] [2020-02-10 20:18:00,334 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:00,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2096303524, now seen corresponding path program 414 times [2020-02-10 20:18:00,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:00,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281544494] [2020-02-10 20:18:00,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:00,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281544494] [2020-02-10 20:18:00,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:00,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:00,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780199455] [2020-02-10 20:18:00,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:00,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:00,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:00,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:00,892 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:18:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:01,073 INFO L93 Difference]: Finished difference Result 2893 states and 11577 transitions. [2020-02-10 20:18:01,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:01,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:01,080 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:18:01,080 INFO L226 Difference]: Without dead ends: 2871 [2020-02-10 20:18:01,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2020-02-10 20:18:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1563. [2020-02-10 20:18:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:18:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7022 transitions. [2020-02-10 20:18:01,144 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7022 transitions. Word has length 28 [2020-02-10 20:18:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:01,144 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7022 transitions. [2020-02-10 20:18:01,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7022 transitions. [2020-02-10 20:18:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:01,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:01,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:01,146 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:01,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:01,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1941436264, now seen corresponding path program 415 times [2020-02-10 20:18:01,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:01,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326769041] [2020-02-10 20:18:01,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:01,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326769041] [2020-02-10 20:18:01,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:01,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:01,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908254955] [2020-02-10 20:18:01,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:01,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:01,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:01,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:01,683 INFO L87 Difference]: Start difference. First operand 1563 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:18:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:01,858 INFO L93 Difference]: Finished difference Result 2903 states and 11611 transitions. [2020-02-10 20:18:01,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:01,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:01,866 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:18:01,866 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:18:01,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:18:01,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1573. [2020-02-10 20:18:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:18:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7050 transitions. [2020-02-10 20:18:01,930 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7050 transitions. Word has length 28 [2020-02-10 20:18:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:01,930 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7050 transitions. [2020-02-10 20:18:01,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7050 transitions. [2020-02-10 20:18:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:01,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:01,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:01,932 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1608828534, now seen corresponding path program 416 times [2020-02-10 20:18:01,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:01,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504053419] [2020-02-10 20:18:01,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:02,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504053419] [2020-02-10 20:18:02,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:02,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:02,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744060206] [2020-02-10 20:18:02,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:02,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:02,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:02,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:02,468 INFO L87 Difference]: Start difference. First operand 1573 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:18:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:02,649 INFO L93 Difference]: Finished difference Result 2904 states and 11608 transitions. [2020-02-10 20:18:02,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:02,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:02,656 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:18:02,656 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:18:02,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:18:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1568. [2020-02-10 20:18:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:18:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7036 transitions. [2020-02-10 20:18:02,719 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7036 transitions. Word has length 28 [2020-02-10 20:18:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:02,719 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7036 transitions. [2020-02-10 20:18:02,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7036 transitions. [2020-02-10 20:18:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:02,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:02,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:02,722 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:02,722 INFO L82 PathProgramCache]: Analyzing trace with hash 333121082, now seen corresponding path program 417 times [2020-02-10 20:18:02,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:02,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284596614] [2020-02-10 20:18:02,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:03,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284596614] [2020-02-10 20:18:03,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:03,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:03,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082303781] [2020-02-10 20:18:03,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:03,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:03,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:03,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:03,255 INFO L87 Difference]: Start difference. First operand 1568 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:18:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:03,433 INFO L93 Difference]: Finished difference Result 2904 states and 11608 transitions. [2020-02-10 20:18:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:03,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:03,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:03,442 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:18:03,442 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 20:18:03,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 20:18:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1573. [2020-02-10 20:18:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:18:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7045 transitions. [2020-02-10 20:18:03,506 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7045 transitions. Word has length 28 [2020-02-10 20:18:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:03,506 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7045 transitions. [2020-02-10 20:18:03,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7045 transitions. [2020-02-10 20:18:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:03,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:03,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:03,508 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1995773770, now seen corresponding path program 418 times [2020-02-10 20:18:03,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:03,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257018718] [2020-02-10 20:18:03,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:04,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257018718] [2020-02-10 20:18:04,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:04,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:04,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899625386] [2020-02-10 20:18:04,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:04,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:04,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:04,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:04,039 INFO L87 Difference]: Start difference. First operand 1573 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:18:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:04,222 INFO L93 Difference]: Finished difference Result 2906 states and 11607 transitions. [2020-02-10 20:18:04,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:04,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:04,229 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:18:04,229 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:18:04,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:18:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1568. [2020-02-10 20:18:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:18:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7031 transitions. [2020-02-10 20:18:04,293 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7031 transitions. Word has length 28 [2020-02-10 20:18:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:04,293 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7031 transitions. [2020-02-10 20:18:04,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7031 transitions. [2020-02-10 20:18:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:04,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:04,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:04,295 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1606202758, now seen corresponding path program 419 times [2020-02-10 20:18:04,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:04,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400058542] [2020-02-10 20:18:04,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:04,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400058542] [2020-02-10 20:18:04,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:04,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:04,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224522440] [2020-02-10 20:18:04,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:04,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:04,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:04,826 INFO L87 Difference]: Start difference. First operand 1568 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:18:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:05,049 INFO L93 Difference]: Finished difference Result 2907 states and 11610 transitions. [2020-02-10 20:18:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:05,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:05,057 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 20:18:05,057 INFO L226 Difference]: Without dead ends: 2891 [2020-02-10 20:18:05,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2020-02-10 20:18:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 1574. [2020-02-10 20:18:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:18:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7042 transitions. [2020-02-10 20:18:05,122 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7042 transitions. Word has length 28 [2020-02-10 20:18:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:05,123 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7042 transitions. [2020-02-10 20:18:05,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7042 transitions. [2020-02-10 20:18:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:05,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:05,125 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:05,125 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash -688252568, now seen corresponding path program 420 times [2020-02-10 20:18:05,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:05,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090516429] [2020-02-10 20:18:05,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:05,576 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 20:18:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:05,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090516429] [2020-02-10 20:18:05,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:05,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:05,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837516137] [2020-02-10 20:18:05,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:05,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:05,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:05,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:05,698 INFO L87 Difference]: Start difference. First operand 1574 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:18:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:05,883 INFO L93 Difference]: Finished difference Result 2908 states and 11606 transitions. [2020-02-10 20:18:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:05,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:05,891 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:18:05,891 INFO L226 Difference]: Without dead ends: 2880 [2020-02-10 20:18:05,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-02-10 20:18:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 1563. [2020-02-10 20:18:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:18:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7018 transitions. [2020-02-10 20:18:05,954 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7018 transitions. Word has length 28 [2020-02-10 20:18:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:05,954 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7018 transitions. [2020-02-10 20:18:05,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7018 transitions. [2020-02-10 20:18:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:05,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:05,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:05,956 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:05,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:05,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1993951784, now seen corresponding path program 421 times [2020-02-10 20:18:05,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:05,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819091631] [2020-02-10 20:18:05,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:06,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819091631] [2020-02-10 20:18:06,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:06,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:06,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247178666] [2020-02-10 20:18:06,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:06,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:06,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:06,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:06,480 INFO L87 Difference]: Start difference. First operand 1563 states and 7018 transitions. Second operand 11 states. [2020-02-10 20:18:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:06,685 INFO L93 Difference]: Finished difference Result 2894 states and 11583 transitions. [2020-02-10 20:18:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:06,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:06,693 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 20:18:06,693 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 20:18:06,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 20:18:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1571. [2020-02-10 20:18:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:18:06,756 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:18:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:06,756 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:18:06,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:18:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:06,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:06,759 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:06,759 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:06,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2127767820, now seen corresponding path program 422 times [2020-02-10 20:18:06,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:06,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001161691] [2020-02-10 20:18:06,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:07,282 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:18:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:07,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001161691] [2020-02-10 20:18:07,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:07,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:07,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985560361] [2020-02-10 20:18:07,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:07,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:07,290 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:18:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:07,487 INFO L93 Difference]: Finished difference Result 2893 states and 11577 transitions. [2020-02-10 20:18:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:07,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:07,494 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:18:07,495 INFO L226 Difference]: Without dead ends: 2875 [2020-02-10 20:18:07,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2020-02-10 20:18:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 1567. [2020-02-10 20:18:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 20:18:07,558 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 20:18:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:07,558 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 20:18:07,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 20:18:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:07,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:07,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, 1, 1, 1] [2020-02-10 20:18:07,560 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:07,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash 920866404, now seen corresponding path program 423 times [2020-02-10 20:18:07,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:07,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53832382] [2020-02-10 20:18:07,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:08,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53832382] [2020-02-10 20:18:08,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:08,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:08,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243173881] [2020-02-10 20:18:08,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:08,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:08,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:08,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:08,078 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:18:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:08,269 INFO L93 Difference]: Finished difference Result 2898 states and 11588 transitions. [2020-02-10 20:18:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:08,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:08,276 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:18:08,276 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:18:08,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:18:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1572. [2020-02-10 20:18:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:18:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7038 transitions. [2020-02-10 20:18:08,340 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7038 transitions. Word has length 28 [2020-02-10 20:18:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:08,340 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7038 transitions. [2020-02-10 20:18:08,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7038 transitions. [2020-02-10 20:18:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:08,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:08,342 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:08,342 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:08,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1711448204, now seen corresponding path program 424 times [2020-02-10 20:18:08,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:08,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182649303] [2020-02-10 20:18:08,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:08,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182649303] [2020-02-10 20:18:08,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:08,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:08,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66674252] [2020-02-10 20:18:08,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:08,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:08,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:08,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:08,863 INFO L87 Difference]: Start difference. First operand 1572 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:18:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:09,083 INFO L93 Difference]: Finished difference Result 2900 states and 11587 transitions. [2020-02-10 20:18:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:09,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:09,091 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 20:18:09,091 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:18:09,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:18:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1567. [2020-02-10 20:18:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:18:09,154 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:18:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:09,155 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:18:09,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:18:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:09,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:09,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:09,157 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:09,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2125142044, now seen corresponding path program 425 times [2020-02-10 20:18:09,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:09,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942281990] [2020-02-10 20:18:09,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:09,674 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:18:09,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-02-10 20:18:09,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942281990] [2020-02-10 20:18:09,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:09,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:09,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453826416] [2020-02-10 20:18:09,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:09,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:09,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:09,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:09,682 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:18:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:09,913 INFO L93 Difference]: Finished difference Result 2895 states and 11577 transitions. [2020-02-10 20:18:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:09,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:09,920 INFO L225 Difference]: With dead ends: 2895 [2020-02-10 20:18:09,920 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:18:09,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:18:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1571. [2020-02-10 20:18:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 20:18:09,984 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 20:18:09,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:09,984 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 20:18:09,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 20:18:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:09,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:09,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:09,986 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:09,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:09,986 INFO L82 PathProgramCache]: Analyzing trace with hash -635737048, now seen corresponding path program 426 times [2020-02-10 20:18:09,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:09,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438986605] [2020-02-10 20:18:09,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:10,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438986605] [2020-02-10 20:18:10,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:10,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:10,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093001916] [2020-02-10 20:18:10,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:10,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:10,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:10,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:10,510 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:18:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:10,731 INFO L93 Difference]: Finished difference Result 2898 states and 11579 transitions. [2020-02-10 20:18:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:10,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:10,737 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:18:10,738 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 20:18:10,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 20:18:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1563. [2020-02-10 20:18:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:18:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7014 transitions. [2020-02-10 20:18:10,800 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7014 transitions. Word has length 28 [2020-02-10 20:18:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:10,800 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7014 transitions. [2020-02-10 20:18:10,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7014 transitions. [2020-02-10 20:18:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:10,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:10,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:10,803 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:10,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:10,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1545809910, now seen corresponding path program 427 times [2020-02-10 20:18:10,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:10,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044447662] [2020-02-10 20:18:10,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:11,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044447662] [2020-02-10 20:18:11,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:11,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:11,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839117362] [2020-02-10 20:18:11,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:11,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:11,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:11,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:11,327 INFO L87 Difference]: Start difference. First operand 1563 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:18:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:11,521 INFO L93 Difference]: Finished difference Result 2898 states and 11588 transitions. [2020-02-10 20:18:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:11,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:11,528 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:18:11,528 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 20:18:11,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 20:18:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1571. [2020-02-10 20:18:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:18:11,592 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:18:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:11,592 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:18:11,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:18:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:11,594 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:11,594 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:11,594 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2117264716, now seen corresponding path program 428 times [2020-02-10 20:18:11,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:11,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521705596] [2020-02-10 20:18:11,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:12,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521705596] [2020-02-10 20:18:12,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:12,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:12,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603690000] [2020-02-10 20:18:12,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:12,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:12,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:12,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:12,118 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:18:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:12,343 INFO L93 Difference]: Finished difference Result 2896 states and 11580 transitions. [2020-02-10 20:18:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:12,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:12,351 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:18:12,351 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:18:12,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:18:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1567. [2020-02-10 20:18:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:18:12,415 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:18:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:12,415 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:18:12,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:18:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:12,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:12,418 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:12,418 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:12,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1676072006, now seen corresponding path program 429 times [2020-02-10 20:18:12,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:12,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726101413] [2020-02-10 20:18:12,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:12,939 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:18:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:12,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726101413] [2020-02-10 20:18:12,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:12,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:12,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164991261] [2020-02-10 20:18:12,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:12,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:12,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:12,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:12,947 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:18:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:13,143 INFO L93 Difference]: Finished difference Result 2903 states and 11596 transitions. [2020-02-10 20:18:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:13,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:13,150 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:18:13,150 INFO L226 Difference]: Without dead ends: 2887 [2020-02-10 20:18:13,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2020-02-10 20:18:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1573. [2020-02-10 20:18:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:18:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7036 transitions. [2020-02-10 20:18:13,213 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7036 transitions. Word has length 28 [2020-02-10 20:18:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:13,213 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7036 transitions. [2020-02-10 20:18:13,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7036 transitions. [2020-02-10 20:18:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:13,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:13,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:13,216 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1700945100, now seen corresponding path program 430 times [2020-02-10 20:18:13,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:13,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372444956] [2020-02-10 20:18:13,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:13,754 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:18:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:13,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372444956] [2020-02-10 20:18:13,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:13,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:13,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186754319] [2020-02-10 20:18:13,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:13,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:13,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:13,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:13,762 INFO L87 Difference]: Start difference. First operand 1573 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:18:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:13,948 INFO L93 Difference]: Finished difference Result 2904 states and 11592 transitions. [2020-02-10 20:18:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:13,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:13,956 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:18:13,956 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:18:13,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:18:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1567. [2020-02-10 20:18:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 20:18:14,019 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 20:18:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:14,020 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 20:18:14,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 20:18:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:14,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:14,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:14,022 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:14,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:14,022 INFO L82 PathProgramCache]: Analyzing trace with hash 569387398, now seen corresponding path program 431 times [2020-02-10 20:18:14,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:14,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47651634] [2020-02-10 20:18:14,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:14,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47651634] [2020-02-10 20:18:14,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:14,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:14,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220120313] [2020-02-10 20:18:14,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:14,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:14,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:14,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:14,538 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:18:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:14,725 INFO L93 Difference]: Finished difference Result 2897 states and 11578 transitions. [2020-02-10 20:18:14,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:14,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:14,733 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:18:14,733 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:18:14,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:18:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1571. [2020-02-10 20:18:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7028 transitions. [2020-02-10 20:18:14,795 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7028 transitions. Word has length 28 [2020-02-10 20:18:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:14,796 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7028 transitions. [2020-02-10 20:18:14,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7028 transitions. [2020-02-10 20:18:14,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:14,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:14,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:14,798 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:14,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2058792394, now seen corresponding path program 432 times [2020-02-10 20:18:14,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:14,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674042245] [2020-02-10 20:18:14,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:15,320 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:18:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:15,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674042245] [2020-02-10 20:18:15,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:15,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:15,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959753655] [2020-02-10 20:18:15,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:15,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:15,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:15,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:15,328 INFO L87 Difference]: Start difference. First operand 1571 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:18:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:15,542 INFO L93 Difference]: Finished difference Result 2900 states and 11580 transitions. [2020-02-10 20:18:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:15,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:15,550 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 20:18:15,550 INFO L226 Difference]: Without dead ends: 2871 [2020-02-10 20:18:15,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2020-02-10 20:18:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1559. [2020-02-10 20:18:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 20:18:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 7003 transitions. [2020-02-10 20:18:15,613 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 7003 transitions. Word has length 28 [2020-02-10 20:18:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:15,613 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 7003 transitions. [2020-02-10 20:18:15,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 7003 transitions. [2020-02-10 20:18:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:15,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:15,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:15,615 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:15,616 INFO L82 PathProgramCache]: Analyzing trace with hash 425451744, now seen corresponding path program 433 times [2020-02-10 20:18:15,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:15,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636791944] [2020-02-10 20:18:15,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:16,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636791944] [2020-02-10 20:18:16,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:16,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:16,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862809423] [2020-02-10 20:18:16,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:16,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:16,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:16,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:16,144 INFO L87 Difference]: Start difference. First operand 1559 states and 7003 transitions. Second operand 11 states. [2020-02-10 20:18:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:16,318 INFO L93 Difference]: Finished difference Result 2903 states and 11607 transitions. [2020-02-10 20:18:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:16,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:16,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:16,325 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:18:16,325 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:18:16,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:18:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1572. [2020-02-10 20:18:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:18:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7046 transitions. [2020-02-10 20:18:16,390 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7046 transitions. Word has length 28 [2020-02-10 20:18:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:16,390 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7046 transitions. [2020-02-10 20:18:16,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7046 transitions. [2020-02-10 20:18:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:16,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:16,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:16,393 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1635408058, now seen corresponding path program 434 times [2020-02-10 20:18:16,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:16,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371838528] [2020-02-10 20:18:16,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:16,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371838528] [2020-02-10 20:18:16,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:16,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:16,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048771] [2020-02-10 20:18:16,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:16,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:16,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:16,924 INFO L87 Difference]: Start difference. First operand 1572 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:18:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:17,095 INFO L93 Difference]: Finished difference Result 2906 states and 11608 transitions. [2020-02-10 20:18:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:17,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:17,103 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:18:17,103 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:18:17,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:18:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1567. [2020-02-10 20:18:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 20:18:17,166 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 20:18:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:17,167 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 20:18:17,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 20:18:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:17,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:17,169 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:17,169 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:17,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash 963307322, now seen corresponding path program 435 times [2020-02-10 20:18:17,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:17,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578638263] [2020-02-10 20:18:17,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:17,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578638263] [2020-02-10 20:18:17,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:17,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:17,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506041234] [2020-02-10 20:18:17,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:17,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:17,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:17,701 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:18:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:17,898 INFO L93 Difference]: Finished difference Result 2898 states and 11592 transitions. [2020-02-10 20:18:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:17,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:17,906 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:18:17,906 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:18:17,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:17,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:18:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1571. [2020-02-10 20:18:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:18:17,969 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:18:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:17,969 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:18:17,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:18:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:17,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:17,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:17,972 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1136555014, now seen corresponding path program 436 times [2020-02-10 20:18:17,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:17,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640263979] [2020-02-10 20:18:17,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:18,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640263979] [2020-02-10 20:18:18,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:18,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:18,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126523932] [2020-02-10 20:18:18,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:18,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:18,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:18,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:18,504 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:18:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:18,703 INFO L93 Difference]: Finished difference Result 2897 states and 11586 transitions. [2020-02-10 20:18:18,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:18,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:18,709 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:18:18,710 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 20:18:18,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 20:18:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1567. [2020-02-10 20:18:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 20:18:18,773 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 20:18:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:18,773 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 20:18:18,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 20:18:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:18,775 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:18,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, 1, 1, 1] [2020-02-10 20:18:18,775 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:18,775 INFO L82 PathProgramCache]: Analyzing trace with hash -559696902, now seen corresponding path program 437 times [2020-02-10 20:18:18,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:18,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320853471] [2020-02-10 20:18:18,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:19,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320853471] [2020-02-10 20:18:19,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:19,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:19,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471686743] [2020-02-10 20:18:19,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:19,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:19,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:19,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:19,300 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:18:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:19,496 INFO L93 Difference]: Finished difference Result 2904 states and 11600 transitions. [2020-02-10 20:18:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:19,497 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:19,504 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:18:19,504 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:18:19,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:18:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1571. [2020-02-10 20:18:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:18:19,568 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:18:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:19,569 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:18:19,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:18:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:19,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:19,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:19,571 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:19,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:19,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1674410592, now seen corresponding path program 438 times [2020-02-10 20:18:19,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:19,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212878532] [2020-02-10 20:18:19,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:20,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212878532] [2020-02-10 20:18:20,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:20,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:20,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301201854] [2020-02-10 20:18:20,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:20,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:20,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:20,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:20,087 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:18:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:20,266 INFO L93 Difference]: Finished difference Result 2900 states and 11588 transitions. [2020-02-10 20:18:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:20,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:20,273 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 20:18:20,274 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:18:20,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:18:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1563. [2020-02-10 20:18:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:18:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7018 transitions. [2020-02-10 20:18:20,336 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7018 transitions. Word has length 28 [2020-02-10 20:18:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:20,337 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7018 transitions. [2020-02-10 20:18:20,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7018 transitions. [2020-02-10 20:18:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:20,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:20,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, 1, 1, 1] [2020-02-10 20:18:20,339 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:20,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:20,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1519543332, now seen corresponding path program 439 times [2020-02-10 20:18:20,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:20,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768650640] [2020-02-10 20:18:20,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:20,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768650640] [2020-02-10 20:18:20,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:20,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:20,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059391353] [2020-02-10 20:18:20,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:20,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:20,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:20,859 INFO L87 Difference]: Start difference. First operand 1563 states and 7018 transitions. Second operand 11 states. [2020-02-10 20:18:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:21,055 INFO L93 Difference]: Finished difference Result 2911 states and 11625 transitions. [2020-02-10 20:18:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:21,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:21,062 INFO L225 Difference]: With dead ends: 2911 [2020-02-10 20:18:21,062 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:18:21,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:18:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1573. [2020-02-10 20:18:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:18:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7046 transitions. [2020-02-10 20:18:21,129 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7046 transitions. Word has length 28 [2020-02-10 20:18:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:21,129 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7046 transitions. [2020-02-10 20:18:21,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7046 transitions. [2020-02-10 20:18:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:21,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:21,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:21,132 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash -541316470, now seen corresponding path program 440 times [2020-02-10 20:18:21,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:21,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215699508] [2020-02-10 20:18:21,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:21,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215699508] [2020-02-10 20:18:21,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:21,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:21,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414172209] [2020-02-10 20:18:21,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:21,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:21,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:21,642 INFO L87 Difference]: Start difference. First operand 1573 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:18:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:21,811 INFO L93 Difference]: Finished difference Result 2914 states and 11626 transitions. [2020-02-10 20:18:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:21,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:21,820 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:18:21,821 INFO L226 Difference]: Without dead ends: 2891 [2020-02-10 20:18:21,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2020-02-10 20:18:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 1568. [2020-02-10 20:18:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:18:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7032 transitions. [2020-02-10 20:18:21,888 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7032 transitions. Word has length 28 [2020-02-10 20:18:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:21,888 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7032 transitions. [2020-02-10 20:18:21,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7032 transitions. [2020-02-10 20:18:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:21,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:21,891 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:21,891 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:21,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:21,891 INFO L82 PathProgramCache]: Analyzing trace with hash 984313530, now seen corresponding path program 441 times [2020-02-10 20:18:21,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:21,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998093933] [2020-02-10 20:18:21,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:22,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998093933] [2020-02-10 20:18:22,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:22,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:22,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239642688] [2020-02-10 20:18:22,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:22,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:22,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:22,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:22,403 INFO L87 Difference]: Start difference. First operand 1568 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:18:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:22,578 INFO L93 Difference]: Finished difference Result 2910 states and 11618 transitions. [2020-02-10 20:18:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:22,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:22,586 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:18:22,586 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:18:22,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:18:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1573. [2020-02-10 20:18:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:18:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7041 transitions. [2020-02-10 20:18:22,652 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7041 transitions. Word has length 28 [2020-02-10 20:18:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:22,652 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7041 transitions. [2020-02-10 20:18:22,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7041 transitions. [2020-02-10 20:18:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:22,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:22,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:22,655 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:22,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:22,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1648001078, now seen corresponding path program 442 times [2020-02-10 20:18:22,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:22,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844735605] [2020-02-10 20:18:22,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:23,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844735605] [2020-02-10 20:18:23,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:23,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:23,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004944223] [2020-02-10 20:18:23,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:23,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:23,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:23,171 INFO L87 Difference]: Start difference. First operand 1573 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:18:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:23,354 INFO L93 Difference]: Finished difference Result 2912 states and 11617 transitions. [2020-02-10 20:18:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:23,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:23,362 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:18:23,362 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:18:23,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:18:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1568. [2020-02-10 20:18:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:18:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7027 transitions. [2020-02-10 20:18:23,425 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7027 transitions. Word has length 28 [2020-02-10 20:18:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:23,426 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7027 transitions. [2020-02-10 20:18:23,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7027 transitions. [2020-02-10 20:18:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:23,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:23,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:23,428 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:23,428 INFO L82 PathProgramCache]: Analyzing trace with hash -538690694, now seen corresponding path program 443 times [2020-02-10 20:18:23,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:23,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982678386] [2020-02-10 20:18:23,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:23,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982678386] [2020-02-10 20:18:23,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:23,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:23,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275585727] [2020-02-10 20:18:23,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:23,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:23,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:23,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:23,939 INFO L87 Difference]: Start difference. First operand 1568 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:18:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:24,110 INFO L93 Difference]: Finished difference Result 2918 states and 11631 transitions. [2020-02-10 20:18:24,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:24,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:24,118 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 20:18:24,118 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:18:24,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:18:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1575. [2020-02-10 20:18:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:18:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7040 transitions. [2020-02-10 20:18:24,183 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7040 transitions. Word has length 28 [2020-02-10 20:18:24,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:24,183 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7040 transitions. [2020-02-10 20:18:24,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7040 transitions. [2020-02-10 20:18:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:24,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:24,185 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:24,186 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:24,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:24,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1110145500, now seen corresponding path program 444 times [2020-02-10 20:18:24,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:24,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841530780] [2020-02-10 20:18:24,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:24,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841530780] [2020-02-10 20:18:24,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:24,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:24,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902782484] [2020-02-10 20:18:24,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:24,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:24,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:24,702 INFO L87 Difference]: Start difference. First operand 1575 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:18:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:24,882 INFO L93 Difference]: Finished difference Result 2917 states and 11622 transitions. [2020-02-10 20:18:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:24,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:24,889 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:18:24,889 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:18:24,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:18:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1563. [2020-02-10 20:18:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:18:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7014 transitions. [2020-02-10 20:18:24,954 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7014 transitions. Word has length 28 [2020-02-10 20:18:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:24,955 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7014 transitions. [2020-02-10 20:18:24,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7014 transitions. [2020-02-10 20:18:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:24,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:24,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:24,957 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1551052644, now seen corresponding path program 445 times [2020-02-10 20:18:24,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:24,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754556528] [2020-02-10 20:18:24,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:25,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754556528] [2020-02-10 20:18:25,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:25,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:25,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084642532] [2020-02-10 20:18:25,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:25,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:25,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:25,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:25,478 INFO L87 Difference]: Start difference. First operand 1563 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:18:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:25,677 INFO L93 Difference]: Finished difference Result 2897 states and 11586 transitions. [2020-02-10 20:18:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:25,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:25,685 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:18:25,685 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 20:18:25,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 20:18:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1571. [2020-02-10 20:18:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:18:25,750 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:18:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:25,750 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:18:25,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:18:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:25,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:25,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, 1, 1, 1] [2020-02-10 20:18:25,753 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:25,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:25,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1724300336, now seen corresponding path program 446 times [2020-02-10 20:18:25,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:25,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653369433] [2020-02-10 20:18:25,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:26,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653369433] [2020-02-10 20:18:26,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:26,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:26,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269310829] [2020-02-10 20:18:26,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:26,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:26,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:26,295 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:18:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:26,496 INFO L93 Difference]: Finished difference Result 2896 states and 11580 transitions. [2020-02-10 20:18:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:26,497 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:26,504 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:18:26,504 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:18:26,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:18:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1567. [2020-02-10 20:18:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:18:26,569 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:18:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:26,569 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:18:26,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:18:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:26,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:26,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:26,571 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:26,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash 477967264, now seen corresponding path program 447 times [2020-02-10 20:18:26,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:26,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645597135] [2020-02-10 20:18:26,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:27,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645597135] [2020-02-10 20:18:27,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:27,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:27,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902021334] [2020-02-10 20:18:27,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:27,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:27,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:27,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:27,094 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:18:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:27,312 INFO L93 Difference]: Finished difference Result 2901 states and 11591 transitions. [2020-02-10 20:18:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:27,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:27,319 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 20:18:27,319 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:18:27,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:18:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1572. [2020-02-10 20:18:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:18:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7034 transitions. [2020-02-10 20:18:27,382 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7034 transitions. Word has length 28 [2020-02-10 20:18:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:27,383 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7034 transitions. [2020-02-10 20:18:27,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7034 transitions. [2020-02-10 20:18:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:27,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:27,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, 1, 1, 1] [2020-02-10 20:18:27,385 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2140619952, now seen corresponding path program 448 times [2020-02-10 20:18:27,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:27,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181963815] [2020-02-10 20:18:27,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:27,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181963815] [2020-02-10 20:18:27,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:27,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:27,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051446544] [2020-02-10 20:18:27,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:27,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:27,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:27,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:27,899 INFO L87 Difference]: Start difference. First operand 1572 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:18:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:28,084 INFO L93 Difference]: Finished difference Result 2903 states and 11590 transitions. [2020-02-10 20:18:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:28,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:28,092 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:18:28,092 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:18:28,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:18:28,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1567. [2020-02-10 20:18:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 20:18:28,155 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 20:18:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:28,155 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 20:18:28,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 20:18:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:28,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:28,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:28,158 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1726926112, now seen corresponding path program 449 times [2020-02-10 20:18:28,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:28,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308002086] [2020-02-10 20:18:28,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:28,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308002086] [2020-02-10 20:18:28,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:28,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:28,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907059692] [2020-02-10 20:18:28,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:28,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:28,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:28,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:28,674 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:18:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:28,873 INFO L93 Difference]: Finished difference Result 2898 states and 11580 transitions. [2020-02-10 20:18:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:28,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:28,881 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:18:28,881 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:18:28,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:18:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1571. [2020-02-10 20:18:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7028 transitions. [2020-02-10 20:18:28,944 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7028 transitions. Word has length 28 [2020-02-10 20:18:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:28,944 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7028 transitions. [2020-02-10 20:18:28,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7028 transitions. [2020-02-10 20:18:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:28,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:28,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:28,947 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:28,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:28,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1078636188, now seen corresponding path program 450 times [2020-02-10 20:18:28,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:28,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034319897] [2020-02-10 20:18:28,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:29,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034319897] [2020-02-10 20:18:29,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:29,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:29,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124752787] [2020-02-10 20:18:29,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:29,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:29,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:29,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:29,462 INFO L87 Difference]: Start difference. First operand 1571 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:18:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:29,669 INFO L93 Difference]: Finished difference Result 2901 states and 11582 transitions. [2020-02-10 20:18:29,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:29,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:29,677 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 20:18:29,677 INFO L226 Difference]: Without dead ends: 2876 [2020-02-10 20:18:29,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:29,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2020-02-10 20:18:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 1563. [2020-02-10 20:18:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:18:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7010 transitions. [2020-02-10 20:18:29,740 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7010 transitions. Word has length 28 [2020-02-10 20:18:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:29,740 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7010 transitions. [2020-02-10 20:18:29,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7010 transitions. [2020-02-10 20:18:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:29,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:29,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:29,743 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:29,743 INFO L82 PathProgramCache]: Analyzing trace with hash -478297846, now seen corresponding path program 451 times [2020-02-10 20:18:29,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:29,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973953499] [2020-02-10 20:18:29,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:30,250 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:18:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:30,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973953499] [2020-02-10 20:18:30,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:30,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:30,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298886619] [2020-02-10 20:18:30,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:30,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:30,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:30,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:30,258 INFO L87 Difference]: Start difference. First operand 1563 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:18:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:30,441 INFO L93 Difference]: Finished difference Result 2908 states and 11606 transitions. [2020-02-10 20:18:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:30,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:30,448 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:18:30,448 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:18:30,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:18:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1571. [2020-02-10 20:18:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 20:18:30,512 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 20:18:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:30,512 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 20:18:30,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 20:18:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:30,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:30,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:30,514 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1755809648, now seen corresponding path program 452 times [2020-02-10 20:18:30,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:30,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663950483] [2020-02-10 20:18:30,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:31,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663950483] [2020-02-10 20:18:31,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:31,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:31,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060942477] [2020-02-10 20:18:31,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:31,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:31,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:31,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:31,103 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:18:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:31,281 INFO L93 Difference]: Finished difference Result 2904 states and 11594 transitions. [2020-02-10 20:18:31,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:31,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:31,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:31,288 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:18:31,288 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:18:31,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:18:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1567. [2020-02-10 20:18:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 20:18:31,374 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 20:18:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:31,374 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 20:18:31,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 20:18:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:31,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:31,377 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:31,377 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1551383226, now seen corresponding path program 453 times [2020-02-10 20:18:31,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:31,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598571353] [2020-02-10 20:18:31,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:31,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598571353] [2020-02-10 20:18:31,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:31,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:31,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369176976] [2020-02-10 20:18:31,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:31,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:31,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:31,888 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:18:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:32,097 INFO L93 Difference]: Finished difference Result 2914 states and 11617 transitions. [2020-02-10 20:18:32,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:32,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:32,104 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:18:32,104 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:18:32,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:18:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1574. [2020-02-10 20:18:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:18:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7034 transitions. [2020-02-10 20:18:32,169 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7034 transitions. Word has length 28 [2020-02-10 20:18:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:32,169 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7034 transitions. [2020-02-10 20:18:32,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7034 transitions. [2020-02-10 20:18:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:32,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:32,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:32,172 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2122838032, now seen corresponding path program 454 times [2020-02-10 20:18:32,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:32,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221191932] [2020-02-10 20:18:32,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:32,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221191932] [2020-02-10 20:18:32,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:32,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:32,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800448707] [2020-02-10 20:18:32,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:32,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:32,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:32,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:32,688 INFO L87 Difference]: Start difference. First operand 1574 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:18:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:32,882 INFO L93 Difference]: Finished difference Result 2913 states and 11608 transitions. [2020-02-10 20:18:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:32,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:32,889 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 20:18:32,890 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 20:18:32,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 20:18:32,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1567. [2020-02-10 20:18:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7017 transitions. [2020-02-10 20:18:32,953 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7017 transitions. Word has length 28 [2020-02-10 20:18:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:32,953 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7017 transitions. [2020-02-10 20:18:32,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7017 transitions. [2020-02-10 20:18:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:32,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:32,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:32,955 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:32,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1220579846, now seen corresponding path program 455 times [2020-02-10 20:18:32,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:32,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371394460] [2020-02-10 20:18:32,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:33,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371394460] [2020-02-10 20:18:33,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:33,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:33,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801660557] [2020-02-10 20:18:33,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:33,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:33,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:33,470 INFO L87 Difference]: Start difference. First operand 1567 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:18:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:33,698 INFO L93 Difference]: Finished difference Result 2903 states and 11588 transitions. [2020-02-10 20:18:33,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:33,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:33,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:33,706 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:18:33,706 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 20:18:33,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 20:18:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1571. [2020-02-10 20:18:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7024 transitions. [2020-02-10 20:18:33,769 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7024 transitions. Word has length 28 [2020-02-10 20:18:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:33,769 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7024 transitions. [2020-02-10 20:18:33,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7024 transitions. [2020-02-10 20:18:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:33,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:33,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:33,772 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:33,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:33,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1584982454, now seen corresponding path program 456 times [2020-02-10 20:18:33,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:33,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938457900] [2020-02-10 20:18:33,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:34,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938457900] [2020-02-10 20:18:34,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:34,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:34,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894123764] [2020-02-10 20:18:34,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:34,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:34,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:34,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:34,279 INFO L87 Difference]: Start difference. First operand 1571 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:18:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:34,500 INFO L93 Difference]: Finished difference Result 2906 states and 11590 transitions. [2020-02-10 20:18:34,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:34,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:34,507 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:18:34,507 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:18:34,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:18:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1559. [2020-02-10 20:18:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 20:18:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 6999 transitions. [2020-02-10 20:18:34,572 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 6999 transitions. Word has length 28 [2020-02-10 20:18:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:34,572 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 6999 transitions. [2020-02-10 20:18:34,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 6999 transitions. [2020-02-10 20:18:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:34,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:34,575 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:34,575 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:34,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1188275872, now seen corresponding path program 457 times [2020-02-10 20:18:34,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:34,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109618786] [2020-02-10 20:18:34,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:35,084 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:18:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:35,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109618786] [2020-02-10 20:18:35,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:35,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:35,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81478832] [2020-02-10 20:18:35,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:35,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:35,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:35,092 INFO L87 Difference]: Start difference. First operand 1559 states and 6999 transitions. Second operand 11 states. [2020-02-10 20:18:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:35,302 INFO L93 Difference]: Finished difference Result 2912 states and 11627 transitions. [2020-02-10 20:18:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:35,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:35,310 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:18:35,310 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:18:35,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:18:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1573. [2020-02-10 20:18:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:18:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 20:18:35,374 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 20:18:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:35,374 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 20:18:35,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 20:18:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:35,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:35,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:35,376 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash 301129124, now seen corresponding path program 458 times [2020-02-10 20:18:35,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:35,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359007284] [2020-02-10 20:18:35,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:35,891 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:18:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:35,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359007284] [2020-02-10 20:18:35,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:35,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:35,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092821763] [2020-02-10 20:18:35,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:35,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:35,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:35,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:35,898 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:18:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:36,081 INFO L93 Difference]: Finished difference Result 2914 states and 11625 transitions. [2020-02-10 20:18:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:36,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:36,089 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:18:36,089 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:18:36,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:18:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1567. [2020-02-10 20:18:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 20:18:36,152 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 20:18:36,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:36,152 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 20:18:36,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 20:18:36,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:36,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:36,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:36,155 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:36,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:36,155 INFO L82 PathProgramCache]: Analyzing trace with hash -650420294, now seen corresponding path program 459 times [2020-02-10 20:18:36,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:36,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958313582] [2020-02-10 20:18:36,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:36,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958313582] [2020-02-10 20:18:36,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:36,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:36,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546967266] [2020-02-10 20:18:36,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:36,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:36,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:36,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:36,696 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:18:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:36,900 INFO L93 Difference]: Finished difference Result 2906 states and 11609 transitions. [2020-02-10 20:18:36,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:36,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:36,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:36,907 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:18:36,907 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:18:36,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:18:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1571. [2020-02-10 20:18:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:18:36,971 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:18:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:36,971 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:18:36,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:18:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:36,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:36,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:36,974 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1221875100, now seen corresponding path program 460 times [2020-02-10 20:18:36,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:36,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236427997] [2020-02-10 20:18:36,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:37,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236427997] [2020-02-10 20:18:37,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:37,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:37,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826083452] [2020-02-10 20:18:37,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:37,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:37,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:37,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:37,483 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:18:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:37,707 INFO L93 Difference]: Finished difference Result 2904 states and 11601 transitions. [2020-02-10 20:18:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:37,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:37,715 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:18:37,715 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:18:37,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:18:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1567. [2020-02-10 20:18:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:18:37,779 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:18:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:37,779 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:18:37,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:18:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:37,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:37,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, 1, 1, 1] [2020-02-10 20:18:37,781 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash -234100678, now seen corresponding path program 461 times [2020-02-10 20:18:37,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:37,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767969161] [2020-02-10 20:18:37,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:38,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767969161] [2020-02-10 20:18:38,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:38,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:38,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628417153] [2020-02-10 20:18:38,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:38,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:38,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:38,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:38,291 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:18:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:38,494 INFO L93 Difference]: Finished difference Result 2910 states and 11613 transitions. [2020-02-10 20:18:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:38,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:38,502 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:18:38,502 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 20:18:38,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 20:18:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1571. [2020-02-10 20:18:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 20:18:38,566 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 20:18:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:38,566 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 20:18:38,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 20:18:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:38,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18: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, 1, 1, 1] [2020-02-10 20:18:38,569 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:38,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:38,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2000006816, now seen corresponding path program 462 times [2020-02-10 20:18:38,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:38,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120595971] [2020-02-10 20:18:38,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:39,079 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:18:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:39,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120595971] [2020-02-10 20:18:39,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:39,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:39,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688865050] [2020-02-10 20:18:39,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:39,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:39,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:39,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:39,086 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:18:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:39,283 INFO L93 Difference]: Finished difference Result 2906 states and 11601 transitions. [2020-02-10 20:18:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:39,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:39,290 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:18:39,291 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:18:39,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:18:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1563. [2020-02-10 20:18:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:18:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7014 transitions. [2020-02-10 20:18:39,354 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7014 transitions. Word has length 28 [2020-02-10 20:18:39,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:39,354 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7014 transitions. [2020-02-10 20:18:39,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7014 transitions. [2020-02-10 20:18:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:39,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:39,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:39,357 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash -94184284, now seen corresponding path program 463 times [2020-02-10 20:18:39,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:39,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440782566] [2020-02-10 20:18:39,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:39,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440782566] [2020-02-10 20:18:39,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:39,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:39,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944453669] [2020-02-10 20:18:39,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:39,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:39,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:39,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:39,877 INFO L87 Difference]: Start difference. First operand 1563 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:18:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:40,086 INFO L93 Difference]: Finished difference Result 2922 states and 11652 transitions. [2020-02-10 20:18:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:40,087 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:40,094 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:18:40,094 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:18:40,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:18:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1575. [2020-02-10 20:18:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:18:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7048 transitions. [2020-02-10 20:18:40,157 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7048 transitions. Word has length 28 [2020-02-10 20:18:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:40,158 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7048 transitions. [2020-02-10 20:18:40,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7048 transitions. [2020-02-10 20:18:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:40,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:40,160 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:40,160 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:40,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1395220712, now seen corresponding path program 464 times [2020-02-10 20:18:40,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:40,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349054972] [2020-02-10 20:18:40,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:40,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349054972] [2020-02-10 20:18:40,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:40,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:40,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900105919] [2020-02-10 20:18:40,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:40,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:40,697 INFO L87 Difference]: Start difference. First operand 1575 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:18:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:40,882 INFO L93 Difference]: Finished difference Result 2924 states and 11650 transitions. [2020-02-10 20:18:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:40,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:40,889 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:18:40,889 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:18:40,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:18:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1569. [2020-02-10 20:18:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:18:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7031 transitions. [2020-02-10 20:18:40,952 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7031 transitions. Word has length 28 [2020-02-10 20:18:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:40,952 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7031 transitions. [2020-02-10 20:18:40,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7031 transitions. [2020-02-10 20:18:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:40,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:40,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:40,955 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:40,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:40,955 INFO L82 PathProgramCache]: Analyzing trace with hash -629414086, now seen corresponding path program 465 times [2020-02-10 20:18:40,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:40,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186487538] [2020-02-10 20:18:40,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:41,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186487538] [2020-02-10 20:18:41,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:41,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:41,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701015691] [2020-02-10 20:18:41,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:41,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:41,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:41,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:41,491 INFO L87 Difference]: Start difference. First operand 1569 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:18:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:41,751 INFO L93 Difference]: Finished difference Result 2921 states and 11644 transitions. [2020-02-10 20:18:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:41,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:41,777 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:18:41,777 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:18:41,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:18:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1575. [2020-02-10 20:18:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:18:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7042 transitions. [2020-02-10 20:18:41,839 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7042 transitions. Word has length 28 [2020-02-10 20:18:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:41,839 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7042 transitions. [2020-02-10 20:18:41,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7042 transitions. [2020-02-10 20:18:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:41,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:41,841 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:41,841 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:41,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:41,842 INFO L82 PathProgramCache]: Analyzing trace with hash 288536104, now seen corresponding path program 466 times [2020-02-10 20:18:41,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:41,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212452084] [2020-02-10 20:18:41,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:42,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212452084] [2020-02-10 20:18:42,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:42,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:42,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198960874] [2020-02-10 20:18:42,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:42,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:42,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:42,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:42,372 INFO L87 Difference]: Start difference. First operand 1575 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:18:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:42,588 INFO L93 Difference]: Finished difference Result 2922 states and 11640 transitions. [2020-02-10 20:18:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:42,588 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:42,595 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:18:42,595 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:18:42,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:18:42,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1569. [2020-02-10 20:18:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:18:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7025 transitions. [2020-02-10 20:18:42,658 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7025 transitions. Word has length 28 [2020-02-10 20:18:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:42,659 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7025 transitions. [2020-02-10 20:18:42,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7025 transitions. [2020-02-10 20:18:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:42,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:42,661 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:42,661 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash -213094470, now seen corresponding path program 467 times [2020-02-10 20:18:42,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:42,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388746214] [2020-02-10 20:18:42,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:43,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388746214] [2020-02-10 20:18:43,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:43,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:43,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464866912] [2020-02-10 20:18:43,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:43,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:43,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:43,188 INFO L87 Difference]: Start difference. First operand 1569 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:18:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:43,454 INFO L93 Difference]: Finished difference Result 2926 states and 11649 transitions. [2020-02-10 20:18:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:43,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:43,461 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 20:18:43,461 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:18:43,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:43,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:18:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1576. [2020-02-10 20:18:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:18:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7038 transitions. [2020-02-10 20:18:43,524 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7038 transitions. Word has length 28 [2020-02-10 20:18:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:43,524 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7038 transitions. [2020-02-10 20:18:43,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7038 transitions. [2020-02-10 20:18:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:43,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:43,527 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:43,527 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:43,527 INFO L82 PathProgramCache]: Analyzing trace with hash -784549276, now seen corresponding path program 468 times [2020-02-10 20:18:43,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:43,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478644425] [2020-02-10 20:18:43,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:44,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478644425] [2020-02-10 20:18:44,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:44,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:44,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722742038] [2020-02-10 20:18:44,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:44,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:44,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:44,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:44,061 INFO L87 Difference]: Start difference. First operand 1576 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:18:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:44,278 INFO L93 Difference]: Finished difference Result 2925 states and 11640 transitions. [2020-02-10 20:18:44,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:44,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:44,285 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:18:44,285 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:18:44,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:18:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1563. [2020-02-10 20:18:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:18:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7010 transitions. [2020-02-10 20:18:44,349 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7010 transitions. Word has length 28 [2020-02-10 20:18:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:44,349 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7010 transitions. [2020-02-10 20:18:44,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7010 transitions. [2020-02-10 20:18:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:44,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:44,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:44,351 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:44,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:44,352 INFO L82 PathProgramCache]: Analyzing trace with hash -62674972, now seen corresponding path program 469 times [2020-02-10 20:18:44,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:44,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741689079] [2020-02-10 20:18:44,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:44,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-02-10 20:18:44,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741689079] [2020-02-10 20:18:44,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:44,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:44,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850817905] [2020-02-10 20:18:44,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:44,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:44,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:44,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:44,865 INFO L87 Difference]: Start difference. First operand 1563 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:18:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:45,073 INFO L93 Difference]: Finished difference Result 2905 states and 11603 transitions. [2020-02-10 20:18:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:45,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:45,081 INFO L225 Difference]: With dead ends: 2905 [2020-02-10 20:18:45,082 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 20:18:45,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 20:18:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1571. [2020-02-10 20:18:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 20:18:45,145 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 20:18:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:45,145 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 20:18:45,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 20:18:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:45,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:45,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:45,148 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash -634129778, now seen corresponding path program 470 times [2020-02-10 20:18:45,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:45,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263196324] [2020-02-10 20:18:45,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:45,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263196324] [2020-02-10 20:18:45,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:45,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:45,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356944530] [2020-02-10 20:18:45,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:45,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:45,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:45,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:45,659 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:18:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:45,862 INFO L93 Difference]: Finished difference Result 2903 states and 11595 transitions. [2020-02-10 20:18:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:45,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:45,869 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:18:45,869 INFO L226 Difference]: Without dead ends: 2885 [2020-02-10 20:18:45,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2020-02-10 20:18:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1567. [2020-02-10 20:18:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 20:18:45,933 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 20:18:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:45,933 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 20:18:45,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 20:18:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:45,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:45,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, 1, 1, 1] [2020-02-10 20:18:45,935 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1135760352, now seen corresponding path program 471 times [2020-02-10 20:18:45,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:45,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524332190] [2020-02-10 20:18:45,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:46,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524332190] [2020-02-10 20:18:46,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:46,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:46,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314279077] [2020-02-10 20:18:46,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:46,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:46,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:46,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:46,465 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:18:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:46,660 INFO L93 Difference]: Finished difference Result 2910 states and 11611 transitions. [2020-02-10 20:18:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:46,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:46,668 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:18:46,668 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 20:18:46,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 20:18:46,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1573. [2020-02-10 20:18:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:18:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7032 transitions. [2020-02-10 20:18:46,735 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7032 transitions. Word has length 28 [2020-02-10 20:18:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:46,735 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7032 transitions. [2020-02-10 20:18:46,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7032 transitions. [2020-02-10 20:18:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:46,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:46,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:46,738 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:46,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:46,738 INFO L82 PathProgramCache]: Analyzing trace with hash -217810162, now seen corresponding path program 472 times [2020-02-10 20:18:46,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:46,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760622040] [2020-02-10 20:18:46,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:47,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760622040] [2020-02-10 20:18:47,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:47,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:47,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841927116] [2020-02-10 20:18:47,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:47,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:47,288 INFO L87 Difference]: Start difference. First operand 1573 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:18:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:47,558 INFO L93 Difference]: Finished difference Result 2911 states and 11607 transitions. [2020-02-10 20:18:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:47,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:47,566 INFO L225 Difference]: With dead ends: 2911 [2020-02-10 20:18:47,566 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:18:47,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:18:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1567. [2020-02-10 20:18:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7017 transitions. [2020-02-10 20:18:47,629 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7017 transitions. Word has length 28 [2020-02-10 20:18:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:47,630 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7017 transitions. [2020-02-10 20:18:47,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7017 transitions. [2020-02-10 20:18:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:47,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:47,632 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:47,632 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:47,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2052522336, now seen corresponding path program 473 times [2020-02-10 20:18:47,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:47,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539793820] [2020-02-10 20:18:47,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:48,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539793820] [2020-02-10 20:18:48,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:48,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:48,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778329345] [2020-02-10 20:18:48,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:48,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:48,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:48,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:48,153 INFO L87 Difference]: Start difference. First operand 1567 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:18:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:48,352 INFO L93 Difference]: Finished difference Result 2904 states and 11593 transitions. [2020-02-10 20:18:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:48,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:48,360 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:18:48,360 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:18:48,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:18:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1571. [2020-02-10 20:18:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7024 transitions. [2020-02-10 20:18:48,423 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7024 transitions. Word has length 28 [2020-02-10 20:18:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:48,423 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7024 transitions. [2020-02-10 20:18:48,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7024 transitions. [2020-02-10 20:18:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:48,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:48,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:48,426 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:48,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash -753039964, now seen corresponding path program 474 times [2020-02-10 20:18:48,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:48,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225284343] [2020-02-10 20:18:48,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:48,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225284343] [2020-02-10 20:18:48,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:48,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:48,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812435542] [2020-02-10 20:18:48,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:48,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:48,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:48,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:48,949 INFO L87 Difference]: Start difference. First operand 1571 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:18:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:49,216 INFO L93 Difference]: Finished difference Result 2907 states and 11595 transitions. [2020-02-10 20:18:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:49,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:49,224 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 20:18:49,224 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 20:18:49,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 20:18:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1563. [2020-02-10 20:18:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:18:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7006 transitions. [2020-02-10 20:18:49,288 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7006 transitions. Word has length 28 [2020-02-10 20:18:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:49,288 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7006 transitions. [2020-02-10 20:18:49,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7006 transitions. [2020-02-10 20:18:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:49,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:49,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, 1, 1, 1] [2020-02-10 20:18:49,290 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1447736232, now seen corresponding path program 475 times [2020-02-10 20:18:49,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:49,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791085312] [2020-02-10 20:18:49,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:49,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791085312] [2020-02-10 20:18:49,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:49,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:49,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941678306] [2020-02-10 20:18:49,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:49,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:49,816 INFO L87 Difference]: Start difference. First operand 1563 states and 7006 transitions. Second operand 11 states. [2020-02-10 20:18:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:49,988 INFO L93 Difference]: Finished difference Result 2912 states and 11614 transitions. [2020-02-10 20:18:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:49,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:49,996 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:18:49,996 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 20:18:49,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 20:18:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1571. [2020-02-10 20:18:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7028 transitions. [2020-02-10 20:18:50,059 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7028 transitions. Word has length 28 [2020-02-10 20:18:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:50,059 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7028 transitions. [2020-02-10 20:18:50,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7028 transitions. [2020-02-10 20:18:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:50,062 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:50,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, 1, 1, 1] [2020-02-10 20:18:50,062 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:50,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:50,062 INFO L82 PathProgramCache]: Analyzing trace with hash -613123570, now seen corresponding path program 476 times [2020-02-10 20:18:50,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:50,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025779397] [2020-02-10 20:18:50,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18: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-02-10 20:18:50,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025779397] [2020-02-10 20:18:50,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:50,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:50,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173499164] [2020-02-10 20:18:50,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:50,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:50,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:50,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:50,585 INFO L87 Difference]: Start difference. First operand 1571 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:18:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:50,751 INFO L93 Difference]: Finished difference Result 2908 states and 11602 transitions. [2020-02-10 20:18:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:50,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:50,758 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:18:50,758 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:18:50,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:18:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1567. [2020-02-10 20:18:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7017 transitions. [2020-02-10 20:18:50,821 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7017 transitions. Word has length 28 [2020-02-10 20:18:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:50,821 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7017 transitions. [2020-02-10 20:18:50,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7017 transitions. [2020-02-10 20:18:50,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:50,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:50,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, 1, 1, 1] [2020-02-10 20:18:50,824 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:50,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:50,824 INFO L82 PathProgramCache]: Analyzing trace with hash 374650852, now seen corresponding path program 477 times [2020-02-10 20:18:50,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:50,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931498495] [2020-02-10 20:18:50,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:51,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931498495] [2020-02-10 20:18:51,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:51,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:51,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708897390] [2020-02-10 20:18:51,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:51,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:51,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:51,354 INFO L87 Difference]: Start difference. First operand 1567 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:18:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:51,527 INFO L93 Difference]: Finished difference Result 2918 states and 11625 transitions. [2020-02-10 20:18:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:51,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:51,534 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 20:18:51,534 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:18:51,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:18:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1574. [2020-02-10 20:18:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:18:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7030 transitions. [2020-02-10 20:18:51,597 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7030 transitions. Word has length 28 [2020-02-10 20:18:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:51,597 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7030 transitions. [2020-02-10 20:18:51,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7030 transitions. [2020-02-10 20:18:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:51,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:51,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:51,600 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash -196803954, now seen corresponding path program 478 times [2020-02-10 20:18:51,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:51,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332406267] [2020-02-10 20:18:51,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:52,159 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:18:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:52,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332406267] [2020-02-10 20:18:52,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:52,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:52,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129132703] [2020-02-10 20:18:52,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:52,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:52,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:52,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:52,166 INFO L87 Difference]: Start difference. First operand 1574 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:18:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:52,354 INFO L93 Difference]: Finished difference Result 2917 states and 11616 transitions. [2020-02-10 20:18:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:52,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:52,362 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:18:52,362 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 20:18:52,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 20:18:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1567. [2020-02-10 20:18:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:18:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7013 transitions. [2020-02-10 20:18:52,425 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7013 transitions. Word has length 28 [2020-02-10 20:18:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:52,425 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7013 transitions. [2020-02-10 20:18:52,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7013 transitions. [2020-02-10 20:18:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:52,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:52,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:52,428 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:52,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1148353372, now seen corresponding path program 479 times [2020-02-10 20:18:52,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:52,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304304888] [2020-02-10 20:18:52,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:52,943 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:18:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:52,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304304888] [2020-02-10 20:18:52,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:52,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:52,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109653938] [2020-02-10 20:18:52,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:52,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:52,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:52,950 INFO L87 Difference]: Start difference. First operand 1567 states and 7013 transitions. Second operand 11 states. [2020-02-10 20:18:53,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:53,132 INFO L93 Difference]: Finished difference Result 2907 states and 11596 transitions. [2020-02-10 20:18:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:53,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:53,140 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 20:18:53,140 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 20:18:53,140 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 20:18:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1571. [2020-02-10 20:18:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:18:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7020 transitions. [2020-02-10 20:18:53,203 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7020 transitions. Word has length 28 [2020-02-10 20:18:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:53,203 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7020 transitions. [2020-02-10 20:18:53,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7020 transitions. [2020-02-10 20:18:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:53,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:53,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:53,206 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:53,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:53,206 INFO L82 PathProgramCache]: Analyzing trace with hash 341051624, now seen corresponding path program 480 times [2020-02-10 20:18:53,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:53,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866561248] [2020-02-10 20:18:53,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:53,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866561248] [2020-02-10 20:18:53,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:53,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:53,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854183692] [2020-02-10 20:18:53,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:53,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:53,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:53,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:53,731 INFO L87 Difference]: Start difference. First operand 1571 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:18:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:53,925 INFO L93 Difference]: Finished difference Result 2910 states and 11598 transitions. [2020-02-10 20:18:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:53,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:53,932 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:18:53,932 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:18:53,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:18:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1555. [2020-02-10 20:18:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 20:18:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6988 transitions. [2020-02-10 20:18:53,996 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6988 transitions. Word has length 28 [2020-02-10 20:18:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:53,996 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6988 transitions. [2020-02-10 20:18:53,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6988 transitions. [2020-02-10 20:18:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:53,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:54,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:54,000 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:54,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1827506600, now seen corresponding path program 481 times [2020-02-10 20:18:54,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:54,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721700146] [2020-02-10 20:18:54,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:54,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721700146] [2020-02-10 20:18:54,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:54,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:54,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948409425] [2020-02-10 20:18:54,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:54,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:54,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:54,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:54,528 INFO L87 Difference]: Start difference. First operand 1555 states and 6988 transitions. Second operand 11 states. [2020-02-10 20:18:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:54,707 INFO L93 Difference]: Finished difference Result 2973 states and 11790 transitions. [2020-02-10 20:18:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:54,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:54,715 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:18:54,716 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:18:54,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:18:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1581. [2020-02-10 20:18:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:18:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7084 transitions. [2020-02-10 20:18:54,779 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7084 transitions. Word has length 28 [2020-02-10 20:18:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:54,779 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7084 transitions. [2020-02-10 20:18:54,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7084 transitions. [2020-02-10 20:18:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:54,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:54,782 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:54,782 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:54,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash -978055700, now seen corresponding path program 482 times [2020-02-10 20:18:54,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:54,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700859320] [2020-02-10 20:18:54,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:55,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700859320] [2020-02-10 20:18:55,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:55,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:55,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847667578] [2020-02-10 20:18:55,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:55,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:55,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:55,374 INFO L87 Difference]: Start difference. First operand 1581 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:18:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:55,513 INFO L93 Difference]: Finished difference Result 2978 states and 11794 transitions. [2020-02-10 20:18:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:55,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:55,522 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:18:55,522 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:18:55,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:18:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1575. [2020-02-10 20:18:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:18:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7067 transitions. [2020-02-10 20:18:55,587 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7067 transitions. Word has length 28 [2020-02-10 20:18:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:55,587 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7067 transitions. [2020-02-10 20:18:55,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7067 transitions. [2020-02-10 20:18:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:55,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:55,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:55,590 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:55,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:55,590 INFO L82 PathProgramCache]: Analyzing trace with hash -856519738, now seen corresponding path program 483 times [2020-02-10 20:18:55,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:55,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8968705] [2020-02-10 20:18:55,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:56,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8968705] [2020-02-10 20:18:56,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:56,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:56,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805428544] [2020-02-10 20:18:56,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:56,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:56,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:56,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:56,112 INFO L87 Difference]: Start difference. First operand 1575 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:18:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:56,285 INFO L93 Difference]: Finished difference Result 2970 states and 11779 transitions. [2020-02-10 20:18:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:56,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:56,292 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:18:56,292 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 20:18:56,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 20:18:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1580. [2020-02-10 20:18:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:18:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7076 transitions. [2020-02-10 20:18:56,355 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7076 transitions. Word has length 28 [2020-02-10 20:18:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:56,355 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7076 transitions. [2020-02-10 20:18:56,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7076 transitions. [2020-02-10 20:18:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:56,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:56,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:56,358 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:56,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1377587756, now seen corresponding path program 484 times [2020-02-10 20:18:56,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:56,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927012528] [2020-02-10 20:18:56,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:56,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927012528] [2020-02-10 20:18:56,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:56,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:56,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053779426] [2020-02-10 20:18:56,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:56,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:56,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:56,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:56,880 INFO L87 Difference]: Start difference. First operand 1580 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:18:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:57,060 INFO L93 Difference]: Finished difference Result 2973 states and 11780 transitions. [2020-02-10 20:18:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:57,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:57,066 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:18:57,067 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:18:57,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:18:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1575. [2020-02-10 20:18:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:18:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7062 transitions. [2020-02-10 20:18:57,131 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7062 transitions. Word has length 28 [2020-02-10 20:18:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:57,131 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7062 transitions. [2020-02-10 20:18:57,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7062 transitions. [2020-02-10 20:18:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:57,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:57,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:57,134 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash -440200122, now seen corresponding path program 485 times [2020-02-10 20:18:57,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:57,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375931288] [2020-02-10 20:18:57,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:57,487 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2020-02-10 20:18:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:57,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375931288] [2020-02-10 20:18:57,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:57,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:57,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078852397] [2020-02-10 20:18:57,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:57,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:57,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:57,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:57,711 INFO L87 Difference]: Start difference. First operand 1575 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:18:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:57,842 INFO L93 Difference]: Finished difference Result 2985 states and 11804 transitions. [2020-02-10 20:18:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:57,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:57,849 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:18:57,849 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:18:57,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:18:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1585. [2020-02-10 20:18:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:18:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7079 transitions. [2020-02-10 20:18:57,914 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7079 transitions. Word has length 28 [2020-02-10 20:18:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:57,914 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7079 transitions. [2020-02-10 20:18:57,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7079 transitions. [2020-02-10 20:18:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:57,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:57,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:57,916 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:57,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash 304502376, now seen corresponding path program 486 times [2020-02-10 20:18:57,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:57,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430856778] [2020-02-10 20:18:57,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:58,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430856778] [2020-02-10 20:18:58,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:58,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:58,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253695104] [2020-02-10 20:18:58,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:58,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:58,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:58,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:58,450 INFO L87 Difference]: Start difference. First operand 1585 states and 7079 transitions. Second operand 11 states. [2020-02-10 20:18:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:58,649 INFO L93 Difference]: Finished difference Result 2983 states and 11792 transitions. [2020-02-10 20:18:58,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:58,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:58,656 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:18:58,657 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:18:58,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:18:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1568. [2020-02-10 20:18:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:18:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7043 transitions. [2020-02-10 20:18:58,721 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7043 transitions. Word has length 28 [2020-02-10 20:18:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:58,722 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7043 transitions. [2020-02-10 20:18:58,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7043 transitions. [2020-02-10 20:18:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:58,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:58,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:58,724 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:58,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:58,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1321160334, now seen corresponding path program 487 times [2020-02-10 20:18:58,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:58,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049227674] [2020-02-10 20:18:58,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:59,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049227674] [2020-02-10 20:18:59,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:59,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:18:59,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064847510] [2020-02-10 20:18:59,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:18:59,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:59,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:18:59,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:59,253 INFO L87 Difference]: Start difference. First operand 1568 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:18:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:59,432 INFO L93 Difference]: Finished difference Result 2961 states and 11754 transitions. [2020-02-10 20:18:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:18:59,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:18:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:59,439 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:18:59,439 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:18:59,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:18:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:18:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1579. [2020-02-10 20:18:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:18:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7072 transitions. [2020-02-10 20:18:59,503 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7072 transitions. Word has length 28 [2020-02-10 20:18:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:59,503 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7072 transitions. [2020-02-10 20:18:59,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:18:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7072 transitions. [2020-02-10 20:18:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:18:59,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:59,506 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:59,506 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:59,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1484401966, now seen corresponding path program 488 times [2020-02-10 20:18:59,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:59,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423091625] [2020-02-10 20:18:59,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:00,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423091625] [2020-02-10 20:19:00,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:00,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:00,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194425301] [2020-02-10 20:19:00,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:00,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:00,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:00,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:00,043 INFO L87 Difference]: Start difference. First operand 1579 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:19:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:00,185 INFO L93 Difference]: Finished difference Result 2966 states and 11758 transitions. [2020-02-10 20:19:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:00,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:00,193 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:19:00,193 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:19:00,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:19:00,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1573. [2020-02-10 20:19:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:19:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7056 transitions. [2020-02-10 20:19:00,257 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7056 transitions. Word has length 28 [2020-02-10 20:19:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:00,257 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7056 transitions. [2020-02-10 20:19:00,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7056 transitions. [2020-02-10 20:19:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:00,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:00,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:00,259 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:00,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash -825010426, now seen corresponding path program 489 times [2020-02-10 20:19:00,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:00,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116159182] [2020-02-10 20:19:00,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:00,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116159182] [2020-02-10 20:19:00,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:00,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:00,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774838159] [2020-02-10 20:19:00,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:00,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:00,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:00,790 INFO L87 Difference]: Start difference. First operand 1573 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:19:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:00,962 INFO L93 Difference]: Finished difference Result 2953 states and 11733 transitions. [2020-02-10 20:19:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:00,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:00,970 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:19:00,970 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:19:00,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:19:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 20:19:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:19:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7063 transitions. [2020-02-10 20:19:01,033 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7063 transitions. Word has length 28 [2020-02-10 20:19:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:01,034 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7063 transitions. [2020-02-10 20:19:01,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7063 transitions. [2020-02-10 20:19:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:01,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:01,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, 1, 1, 1] [2020-02-10 20:19:01,036 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash -651762734, now seen corresponding path program 490 times [2020-02-10 20:19:01,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:01,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470198793] [2020-02-10 20:19:01,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:01,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470198793] [2020-02-10 20:19:01,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:01,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:01,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908570805] [2020-02-10 20:19:01,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:01,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:01,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:01,561 INFO L87 Difference]: Start difference. First operand 1577 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:19:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:01,764 INFO L93 Difference]: Finished difference Result 2952 states and 11727 transitions. [2020-02-10 20:19:01,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:01,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:01,772 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:19:01,772 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:19:01,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:19:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1573. [2020-02-10 20:19:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:19:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7052 transitions. [2020-02-10 20:19:01,837 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7052 transitions. Word has length 28 [2020-02-10 20:19:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:01,837 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7052 transitions. [2020-02-10 20:19:01,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7052 transitions. [2020-02-10 20:19:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:01,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:01,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:01,840 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:01,840 INFO L82 PathProgramCache]: Analyzing trace with hash -408690810, now seen corresponding path program 491 times [2020-02-10 20:19:01,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:01,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023860084] [2020-02-10 20:19:01,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:02,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023860084] [2020-02-10 20:19:02,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:02,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:02,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641244204] [2020-02-10 20:19:02,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:02,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:02,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:02,360 INFO L87 Difference]: Start difference. First operand 1573 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:19:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:02,502 INFO L93 Difference]: Finished difference Result 2964 states and 11749 transitions. [2020-02-10 20:19:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:02,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:02,509 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:19:02,509 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:19:02,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:19:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1578. [2020-02-10 20:19:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:19:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7060 transitions. [2020-02-10 20:19:02,575 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7060 transitions. Word has length 28 [2020-02-10 20:19:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:02,575 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7060 transitions. [2020-02-10 20:19:02,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7060 transitions. [2020-02-10 20:19:02,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:02,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:02,577 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:02,578 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:02,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1724848114, now seen corresponding path program 492 times [2020-02-10 20:19:02,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:02,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053635313] [2020-02-10 20:19:02,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:03,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053635313] [2020-02-10 20:19:03,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:03,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:03,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879336694] [2020-02-10 20:19:03,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:03,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:03,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:03,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:03,111 INFO L87 Difference]: Start difference. First operand 1578 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:19:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:03,298 INFO L93 Difference]: Finished difference Result 2958 states and 11733 transitions. [2020-02-10 20:19:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:03,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:03,305 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:19:03,305 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:19:03,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:19:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1568. [2020-02-10 20:19:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:19:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7038 transitions. [2020-02-10 20:19:03,368 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7038 transitions. Word has length 28 [2020-02-10 20:19:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:03,368 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7038 transitions. [2020-02-10 20:19:03,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7038 transitions. [2020-02-10 20:19:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:03,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:03,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:03,370 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:03,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1331663438, now seen corresponding path program 493 times [2020-02-10 20:19:03,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:03,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942050971] [2020-02-10 20:19:03,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:03,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942050971] [2020-02-10 20:19:03,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:03,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:03,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319937568] [2020-02-10 20:19:03,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:03,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:03,900 INFO L87 Difference]: Start difference. First operand 1568 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:19:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:04,080 INFO L93 Difference]: Finished difference Result 2953 states and 11734 transitions. [2020-02-10 20:19:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:04,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:04,088 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:19:04,088 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:19:04,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:19:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 20:19:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:19:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 20:19:04,152 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 20:19:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:04,152 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 20:19:04,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 20:19:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:04,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:04,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:04,154 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash -729196364, now seen corresponding path program 494 times [2020-02-10 20:19:04,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:04,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792942132] [2020-02-10 20:19:04,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:04,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792942132] [2020-02-10 20:19:04,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:04,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:04,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210820331] [2020-02-10 20:19:04,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:04,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:04,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:04,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:04,684 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:19:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:04,864 INFO L93 Difference]: Finished difference Result 2956 states and 11735 transitions. [2020-02-10 20:19:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:04,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:04,871 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:19:04,871 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:19:04,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:19:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 20:19:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:19:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7049 transitions. [2020-02-10 20:19:04,936 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7049 transitions. Word has length 28 [2020-02-10 20:19:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:04,936 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7049 transitions. [2020-02-10 20:19:04,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7049 transitions. [2020-02-10 20:19:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:04,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:04,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:04,939 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:04,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:04,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1869519016, now seen corresponding path program 495 times [2020-02-10 20:19:04,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:04,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102525912] [2020-02-10 20:19:04,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19: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-02-10 20:19:05,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102525912] [2020-02-10 20:19:05,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:05,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:05,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891204447] [2020-02-10 20:19:05,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:05,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:05,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:05,472 INFO L87 Difference]: Start difference. First operand 1572 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:19:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:05,647 INFO L93 Difference]: Finished difference Result 2948 states and 11719 transitions. [2020-02-10 20:19:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:05,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:05,654 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:19:05,655 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:19:05,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:19:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1576. [2020-02-10 20:19:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:19:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7056 transitions. [2020-02-10 20:19:05,720 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7056 transitions. Word has length 28 [2020-02-10 20:19:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:05,720 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7056 transitions. [2020-02-10 20:19:05,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7056 transitions. [2020-02-10 20:19:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:05,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:05,723 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:05,723 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2042766708, now seen corresponding path program 496 times [2020-02-10 20:19:05,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:05,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229694968] [2020-02-10 20:19:05,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19: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-02-10 20:19:06,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229694968] [2020-02-10 20:19:06,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:06,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:06,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785883738] [2020-02-10 20:19:06,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:06,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:06,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:06,249 INFO L87 Difference]: Start difference. First operand 1576 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:19:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:06,427 INFO L93 Difference]: Finished difference Result 2947 states and 11713 transitions. [2020-02-10 20:19:06,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:06,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:06,435 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:19:06,435 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:19:06,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:19:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1572. [2020-02-10 20:19:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:19:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7045 transitions. [2020-02-10 20:19:06,499 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7045 transitions. Word has length 28 [2020-02-10 20:19:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:06,499 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7045 transitions. [2020-02-10 20:19:06,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7045 transitions. [2020-02-10 20:19:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:06,501 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19: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, 1, 1, 1] [2020-02-10 20:19:06,501 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:06,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash 346514792, now seen corresponding path program 497 times [2020-02-10 20:19:06,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:06,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647054754] [2020-02-10 20:19:06,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:07,014 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:19:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:07,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647054754] [2020-02-10 20:19:07,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:07,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:07,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493770250] [2020-02-10 20:19:07,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:07,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:07,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:07,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:07,022 INFO L87 Difference]: Start difference. First operand 1572 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:19:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:07,217 INFO L93 Difference]: Finished difference Result 2954 states and 11727 transitions. [2020-02-10 20:19:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:07,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:07,224 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:19:07,224 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:19:07,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:19:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1576. [2020-02-10 20:19:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:19:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7052 transitions. [2020-02-10 20:19:07,288 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7052 transitions. Word has length 28 [2020-02-10 20:19:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:07,288 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7052 transitions. [2020-02-10 20:19:07,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7052 transitions. [2020-02-10 20:19:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:07,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:07,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:07,291 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1714345010, now seen corresponding path program 498 times [2020-02-10 20:19:07,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:07,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304164488] [2020-02-10 20:19:07,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:07,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304164488] [2020-02-10 20:19:07,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:07,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:07,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52785867] [2020-02-10 20:19:07,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:07,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:07,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:07,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:07,810 INFO L87 Difference]: Start difference. First operand 1576 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:19:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:08,004 INFO L93 Difference]: Finished difference Result 2950 states and 11715 transitions. [2020-02-10 20:19:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:08,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:08,011 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:19:08,012 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:19:08,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:19:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1568. [2020-02-10 20:19:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:19:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7034 transitions. [2020-02-10 20:19:08,075 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7034 transitions. Word has length 28 [2020-02-10 20:19:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:08,075 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7034 transitions. [2020-02-10 20:19:08,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7034 transitions. [2020-02-10 20:19:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:08,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:08,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:08,077 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:08,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1452892654, now seen corresponding path program 499 times [2020-02-10 20:19:08,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:08,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319558253] [2020-02-10 20:19:08,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:08,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319558253] [2020-02-10 20:19:08,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:08,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:08,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019452571] [2020-02-10 20:19:08,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:08,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:08,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:08,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:08,627 INFO L87 Difference]: Start difference. First operand 1568 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:19:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:08,762 INFO L93 Difference]: Finished difference Result 2981 states and 11788 transitions. [2020-02-10 20:19:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:08,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:08,770 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:19:08,770 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:19:08,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:19:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1584. [2020-02-10 20:19:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:19:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7071 transitions. [2020-02-10 20:19:08,834 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7071 transitions. Word has length 28 [2020-02-10 20:19:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:08,834 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7071 transitions. [2020-02-10 20:19:08,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7071 transitions. [2020-02-10 20:19:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:08,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:08,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:08,837 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:08,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:08,837 INFO L82 PathProgramCache]: Analyzing trace with hash -708190156, now seen corresponding path program 500 times [2020-02-10 20:19:08,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:08,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580253602] [2020-02-10 20:19:08,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:09,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580253602] [2020-02-10 20:19:09,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:09,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:09,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787199707] [2020-02-10 20:19:09,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:09,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:09,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:09,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:09,377 INFO L87 Difference]: Start difference. First operand 1584 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:19:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:09,546 INFO L93 Difference]: Finished difference Result 2979 states and 11776 transitions. [2020-02-10 20:19:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:09,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:09,553 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:19:09,554 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:19:09,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:19:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1574. [2020-02-10 20:19:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:19:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7048 transitions. [2020-02-10 20:19:09,617 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7048 transitions. Word has length 28 [2020-02-10 20:19:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:09,617 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7048 transitions. [2020-02-10 20:19:09,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7048 transitions. [2020-02-10 20:19:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:09,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:09,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:09,620 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:09,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:09,620 INFO L82 PathProgramCache]: Analyzing trace with hash -915037076, now seen corresponding path program 501 times [2020-02-10 20:19:09,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:09,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074657011] [2020-02-10 20:19:09,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:10,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074657011] [2020-02-10 20:19:10,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:10,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:10,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7966568] [2020-02-10 20:19:10,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:10,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:10,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:10,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:10,140 INFO L87 Difference]: Start difference. First operand 1574 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:19:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:10,272 INFO L93 Difference]: Finished difference Result 2972 states and 11761 transitions. [2020-02-10 20:19:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:10,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:10,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:10,280 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:19:10,280 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:19:10,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:19:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1579. [2020-02-10 20:19:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:19:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7056 transitions. [2020-02-10 20:19:10,344 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7056 transitions. Word has length 28 [2020-02-10 20:19:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:10,344 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7056 transitions. [2020-02-10 20:19:10,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7056 transitions. [2020-02-10 20:19:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:10,346 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:10,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, 1, 1, 1] [2020-02-10 20:19:10,347 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2063772916, now seen corresponding path program 502 times [2020-02-10 20:19:10,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:10,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083986577] [2020-02-10 20:19:10,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:10,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083986577] [2020-02-10 20:19:10,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:10,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:10,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438448486] [2020-02-10 20:19:10,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:10,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:10,857 INFO L87 Difference]: Start difference. First operand 1579 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:19:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:11,032 INFO L93 Difference]: Finished difference Result 2966 states and 11745 transitions. [2020-02-10 20:19:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:11,032 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:11,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:11,040 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:19:11,040 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:19:11,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:19:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1574. [2020-02-10 20:19:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:19:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7043 transitions. [2020-02-10 20:19:11,104 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7043 transitions. Word has length 28 [2020-02-10 20:19:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:11,104 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7043 transitions. [2020-02-10 20:19:11,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7043 transitions. [2020-02-10 20:19:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:11,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:11,106 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:11,107 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:11,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1440606380, now seen corresponding path program 503 times [2020-02-10 20:19:11,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:11,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065157518] [2020-02-10 20:19:11,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:11,637 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:19:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:11,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065157518] [2020-02-10 20:19:11,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:11,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:11,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178066373] [2020-02-10 20:19:11,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:11,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:11,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:11,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:11,645 INFO L87 Difference]: Start difference. First operand 1574 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:19:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:11,818 INFO L93 Difference]: Finished difference Result 2967 states and 11748 transitions. [2020-02-10 20:19:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:11,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:11,826 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:19:11,826 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 20:19:11,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:11,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 20:19:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1578. [2020-02-10 20:19:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:19:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7050 transitions. [2020-02-10 20:19:11,890 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7050 transitions. Word has length 28 [2020-02-10 20:19:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:11,890 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7050 transitions. [2020-02-10 20:19:11,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7050 transitions. [2020-02-10 20:19:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:11,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:11,893 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:11,893 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:11,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:11,893 INFO L82 PathProgramCache]: Analyzing trace with hash -620253422, now seen corresponding path program 504 times [2020-02-10 20:19:11,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:11,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435043923] [2020-02-10 20:19:11,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:12,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435043923] [2020-02-10 20:19:12,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:12,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:12,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614933914] [2020-02-10 20:19:12,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:12,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:12,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:12,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:12,410 INFO L87 Difference]: Start difference. First operand 1578 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:19:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:12,590 INFO L93 Difference]: Finished difference Result 2963 states and 11736 transitions. [2020-02-10 20:19:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:12,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:12,598 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:19:12,598 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:19:12,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:19:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1562. [2020-02-10 20:19:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:19:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7017 transitions. [2020-02-10 20:19:12,664 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7017 transitions. Word has length 28 [2020-02-10 20:19:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:12,664 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7017 transitions. [2020-02-10 20:19:12,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7017 transitions. [2020-02-10 20:19:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:12,666 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:12,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:12,666 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1384607460, now seen corresponding path program 505 times [2020-02-10 20:19:12,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:12,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955154403] [2020-02-10 20:19:12,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:13,111 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 20:19:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:13,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955154403] [2020-02-10 20:19:13,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:13,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:13,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937935946] [2020-02-10 20:19:13,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:13,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:13,231 INFO L87 Difference]: Start difference. First operand 1562 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:19:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:13,438 INFO L93 Difference]: Finished difference Result 2991 states and 11839 transitions. [2020-02-10 20:19:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:13,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:13,445 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:19:13,445 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:19:13,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:19:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1583. [2020-02-10 20:19:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:19:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7085 transitions. [2020-02-10 20:19:13,510 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7085 transitions. Word has length 28 [2020-02-10 20:19:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:13,510 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7085 transitions. [2020-02-10 20:19:13,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7085 transitions. [2020-02-10 20:19:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:13,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:13,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:13,512 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:13,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:13,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1420954840, now seen corresponding path program 506 times [2020-02-10 20:19:13,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:13,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44698406] [2020-02-10 20:19:13,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:14,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44698406] [2020-02-10 20:19:14,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:14,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:14,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341237102] [2020-02-10 20:19:14,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:14,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:14,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:14,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:14,049 INFO L87 Difference]: Start difference. First operand 1583 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:19:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:14,186 INFO L93 Difference]: Finished difference Result 2996 states and 11843 transitions. [2020-02-10 20:19:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:14,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:14,194 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:19:14,194 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:19:14,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:19:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1577. [2020-02-10 20:19:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:19:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7068 transitions. [2020-02-10 20:19:14,258 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7068 transitions. Word has length 28 [2020-02-10 20:19:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:14,258 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7068 transitions. [2020-02-10 20:19:14,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7068 transitions. [2020-02-10 20:19:14,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:14,260 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:14,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:14,260 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1299418878, now seen corresponding path program 507 times [2020-02-10 20:19:14,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:14,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377910873] [2020-02-10 20:19:14,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:14,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377910873] [2020-02-10 20:19:14,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:14,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:14,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099831342] [2020-02-10 20:19:14,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:14,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:14,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:14,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:14,800 INFO L87 Difference]: Start difference. First operand 1577 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:19:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:15,001 INFO L93 Difference]: Finished difference Result 2988 states and 11828 transitions. [2020-02-10 20:19:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:15,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:15,009 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:19:15,009 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 20:19:15,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 20:19:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1582. [2020-02-10 20:19:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:19:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7077 transitions. [2020-02-10 20:19:15,073 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7077 transitions. Word has length 28 [2020-02-10 20:19:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:15,073 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7077 transitions. [2020-02-10 20:19:15,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7077 transitions. [2020-02-10 20:19:15,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:15,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:15,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:15,076 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:15,076 INFO L82 PathProgramCache]: Analyzing trace with hash 934688616, now seen corresponding path program 508 times [2020-02-10 20:19:15,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:15,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111918297] [2020-02-10 20:19:15,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:15,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111918297] [2020-02-10 20:19:15,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:15,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:15,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765261782] [2020-02-10 20:19:15,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:15,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:15,613 INFO L87 Difference]: Start difference. First operand 1582 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:19:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:15,825 INFO L93 Difference]: Finished difference Result 2991 states and 11829 transitions. [2020-02-10 20:19:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:15,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:15,832 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:19:15,832 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:19:15,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:19:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1577. [2020-02-10 20:19:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:19:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7063 transitions. [2020-02-10 20:19:15,895 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7063 transitions. Word has length 28 [2020-02-10 20:19:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:15,895 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7063 transitions. [2020-02-10 20:19:15,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7063 transitions. [2020-02-10 20:19:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:15,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:15,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:15,898 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash -883099262, now seen corresponding path program 509 times [2020-02-10 20:19:15,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:15,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631301687] [2020-02-10 20:19:15,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:16,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631301687] [2020-02-10 20:19:16,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:16,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:16,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991371237] [2020-02-10 20:19:16,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:16,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:16,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:16,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:16,452 INFO L87 Difference]: Start difference. First operand 1577 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:19:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:16,680 INFO L93 Difference]: Finished difference Result 3003 states and 11853 transitions. [2020-02-10 20:19:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:16,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:16,688 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:19:16,688 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:19:16,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:19:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1587. [2020-02-10 20:19:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:19:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7080 transitions. [2020-02-10 20:19:16,752 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7080 transitions. Word has length 28 [2020-02-10 20:19:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:16,752 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7080 transitions. [2020-02-10 20:19:16,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7080 transitions. [2020-02-10 20:19:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:16,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:16,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:16,754 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:16,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:16,754 INFO L82 PathProgramCache]: Analyzing trace with hash -138396764, now seen corresponding path program 510 times [2020-02-10 20:19:16,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:16,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110949720] [2020-02-10 20:19:16,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:17,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110949720] [2020-02-10 20:19:17,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:17,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:17,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774085679] [2020-02-10 20:19:17,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:17,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:17,310 INFO L87 Difference]: Start difference. First operand 1587 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:19:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:17,552 INFO L93 Difference]: Finished difference Result 3001 states and 11841 transitions. [2020-02-10 20:19:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:17,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:17,559 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:19:17,560 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:19:17,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:19:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1570. [2020-02-10 20:19:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:19:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7043 transitions. [2020-02-10 20:19:17,623 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7043 transitions. Word has length 28 [2020-02-10 20:19:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:17,623 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7043 transitions. [2020-02-10 20:19:17,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7043 transitions. [2020-02-10 20:19:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:17,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:17,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:17,626 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:17,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:17,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1972352782, now seen corresponding path program 511 times [2020-02-10 20:19:17,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:17,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291519754] [2020-02-10 20:19:17,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:18,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291519754] [2020-02-10 20:19:18,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:18,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:18,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570735979] [2020-02-10 20:19:18,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:18,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:18,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:18,141 INFO L87 Difference]: Start difference. First operand 1570 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:19:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:18,334 INFO L93 Difference]: Finished difference Result 2987 states and 11824 transitions. [2020-02-10 20:19:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:18,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:18,342 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 20:19:18,342 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 20:19:18,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 20:19:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1582. [2020-02-10 20:19:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:19:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7076 transitions. [2020-02-10 20:19:18,437 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7076 transitions. Word has length 28 [2020-02-10 20:19:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:18,437 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7076 transitions. [2020-02-10 20:19:18,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7076 transitions. [2020-02-10 20:19:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:18,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:18,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:18,440 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash -833209518, now seen corresponding path program 512 times [2020-02-10 20:19:18,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:18,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271581609] [2020-02-10 20:19:18,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:18,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271581609] [2020-02-10 20:19:18,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:18,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:18,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330587968] [2020-02-10 20:19:18,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:18,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:18,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:18,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:18,987 INFO L87 Difference]: Start difference. First operand 1582 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:19:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:19,155 INFO L93 Difference]: Finished difference Result 2992 states and 11828 transitions. [2020-02-10 20:19:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:19,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:19,163 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:19:19,163 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:19:19,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:19:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1576. [2020-02-10 20:19:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:19:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7059 transitions. [2020-02-10 20:19:19,226 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7059 transitions. Word has length 28 [2020-02-10 20:19:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:19,226 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7059 transitions. [2020-02-10 20:19:19,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7059 transitions. [2020-02-10 20:19:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:19,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:19,228 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:19,229 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:19,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1246903358, now seen corresponding path program 513 times [2020-02-10 20:19:19,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:19,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872582988] [2020-02-10 20:19:19,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:19,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-02-10 20:19:19,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872582988] [2020-02-10 20:19:19,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:19,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:19,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710130701] [2020-02-10 20:19:19,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:19,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:19,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:19,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:19,756 INFO L87 Difference]: Start difference. First operand 1576 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:19:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:19,943 INFO L93 Difference]: Finished difference Result 2983 states and 11811 transitions. [2020-02-10 20:19:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:19,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:19,951 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:19:19,951 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:19:19,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:19:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1581. [2020-02-10 20:19:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:19:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7068 transitions. [2020-02-10 20:19:20,014 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7068 transitions. Word has length 28 [2020-02-10 20:19:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:20,015 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7068 transitions. [2020-02-10 20:19:20,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7068 transitions. [2020-02-10 20:19:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:20,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:20,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:20,017 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:20,017 INFO L82 PathProgramCache]: Analyzing trace with hash 415749330, now seen corresponding path program 514 times [2020-02-10 20:19:20,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:20,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389088417] [2020-02-10 20:19:20,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:20,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389088417] [2020-02-10 20:19:20,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:20,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:20,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357783989] [2020-02-10 20:19:20,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:20,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:20,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:20,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:20,540 INFO L87 Difference]: Start difference. First operand 1581 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:19:20,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:20,732 INFO L93 Difference]: Finished difference Result 2985 states and 11810 transitions. [2020-02-10 20:19:20,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:20,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:20,740 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:19:20,740 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:19:20,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:19:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1576. [2020-02-10 20:19:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:19:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 20:19:20,804 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 20:19:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:20,804 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 20:19:20,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 20:19:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:20,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:20,806 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:20,806 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:20,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:20,806 INFO L82 PathProgramCache]: Analyzing trace with hash -830583742, now seen corresponding path program 515 times [2020-02-10 20:19:20,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:20,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113554579] [2020-02-10 20:19:20,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:21,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113554579] [2020-02-10 20:19:21,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:21,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:21,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628879287] [2020-02-10 20:19:21,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:21,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:21,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:21,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:21,336 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:19:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:21,516 INFO L93 Difference]: Finished difference Result 2996 states and 11832 transitions. [2020-02-10 20:19:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:21,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:21,524 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:19:21,524 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:19:21,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:21,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:19:21,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1584. [2020-02-10 20:19:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:19:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7068 transitions. [2020-02-10 20:19:21,587 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7068 transitions. Word has length 28 [2020-02-10 20:19:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:21,588 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7068 transitions. [2020-02-10 20:19:21,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7068 transitions. [2020-02-10 20:19:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:21,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:21,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:21,590 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash -657336050, now seen corresponding path program 516 times [2020-02-10 20:19:21,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:21,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287024704] [2020-02-10 20:19:21,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:22,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287024704] [2020-02-10 20:19:22,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:22,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:22,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012152576] [2020-02-10 20:19:22,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:22,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:22,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:22,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:22,112 INFO L87 Difference]: Start difference. First operand 1584 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:19:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:22,345 INFO L93 Difference]: Finished difference Result 2993 states and 11819 transitions. [2020-02-10 20:19:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:22,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:22,353 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:19:22,353 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:19:22,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:19:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1570. [2020-02-10 20:19:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:19:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7037 transitions. [2020-02-10 20:19:22,416 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7037 transitions. Word has length 28 [2020-02-10 20:19:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:22,416 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7037 transitions. [2020-02-10 20:19:22,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7037 transitions. [2020-02-10 20:19:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:22,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:22,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:22,419 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:22,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1982855886, now seen corresponding path program 517 times [2020-02-10 20:19:22,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:22,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262914818] [2020-02-10 20:19:22,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:22,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262914818] [2020-02-10 20:19:22,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:22,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:22,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076841691] [2020-02-10 20:19:22,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:22,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:22,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:22,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:22,948 INFO L87 Difference]: Start difference. First operand 1570 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:19:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:23,210 INFO L93 Difference]: Finished difference Result 2979 states and 11803 transitions. [2020-02-10 20:19:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:23,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:23,217 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:19:23,217 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:19:23,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:19:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1580. [2020-02-10 20:19:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:19:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7065 transitions. [2020-02-10 20:19:23,281 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7065 transitions. Word has length 28 [2020-02-10 20:19:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:23,282 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7065 transitions. [2020-02-10 20:19:23,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7065 transitions. [2020-02-10 20:19:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:23,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:23,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:23,284 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:23,284 INFO L82 PathProgramCache]: Analyzing trace with hash -78003916, now seen corresponding path program 518 times [2020-02-10 20:19:23,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:23,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751566970] [2020-02-10 20:19:23,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:23,837 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:19:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:23,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751566970] [2020-02-10 20:19:23,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:23,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:23,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461905308] [2020-02-10 20:19:23,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:23,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:23,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:23,845 INFO L87 Difference]: Start difference. First operand 1580 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:19:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:24,019 INFO L93 Difference]: Finished difference Result 2982 states and 11804 transitions. [2020-02-10 20:19:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:24,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:24,026 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:19:24,027 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:19:24,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:19:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1575. [2020-02-10 20:19:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:19:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7051 transitions. [2020-02-10 20:19:24,090 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7051 transitions. Word has length 28 [2020-02-10 20:19:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:24,090 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7051 transitions. [2020-02-10 20:19:24,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7051 transitions. [2020-02-10 20:19:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:24,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:24,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:24,093 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:24,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:24,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1447626084, now seen corresponding path program 519 times [2020-02-10 20:19:24,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:24,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481401194] [2020-02-10 20:19:24,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:24,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481401194] [2020-02-10 20:19:24,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:24,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:24,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78877359] [2020-02-10 20:19:24,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:24,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:24,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:24,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:24,612 INFO L87 Difference]: Start difference. First operand 1575 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:19:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:24,790 INFO L93 Difference]: Finished difference Result 2978 states and 11796 transitions. [2020-02-10 20:19:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:24,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:24,798 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:19:24,798 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:19:24,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:19:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1580. [2020-02-10 20:19:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:19:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7060 transitions. [2020-02-10 20:19:24,862 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7060 transitions. Word has length 28 [2020-02-10 20:19:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:24,862 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7060 transitions. [2020-02-10 20:19:24,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7060 transitions. [2020-02-10 20:19:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:24,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:24,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, 1, 1, 1] [2020-02-10 20:19:24,864 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:24,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:24,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1184688524, now seen corresponding path program 520 times [2020-02-10 20:19:24,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:24,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845776663] [2020-02-10 20:19:24,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:25,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845776663] [2020-02-10 20:19:25,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:25,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:25,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596084445] [2020-02-10 20:19:25,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:25,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:25,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:25,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:25,379 INFO L87 Difference]: Start difference. First operand 1580 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:19:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:25,565 INFO L93 Difference]: Finished difference Result 2980 states and 11795 transitions. [2020-02-10 20:19:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:25,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:25,572 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:19:25,573 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:19:25,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:19:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1575. [2020-02-10 20:19:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:19:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7046 transitions. [2020-02-10 20:19:25,636 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7046 transitions. Word has length 28 [2020-02-10 20:19:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:25,636 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7046 transitions. [2020-02-10 20:19:25,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7046 transitions. [2020-02-10 20:19:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:25,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:25,638 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:25,638 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:25,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:25,639 INFO L82 PathProgramCache]: Analyzing trace with hash -75378140, now seen corresponding path program 521 times [2020-02-10 20:19:25,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:25,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045725091] [2020-02-10 20:19:25,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:26,166 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:19:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:26,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045725091] [2020-02-10 20:19:26,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:26,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:26,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749579560] [2020-02-10 20:19:26,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:26,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:26,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:26,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:26,173 INFO L87 Difference]: Start difference. First operand 1575 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:19:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:26,360 INFO L93 Difference]: Finished difference Result 2986 states and 11809 transitions. [2020-02-10 20:19:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:26,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:26,367 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:19:26,367 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:19:26,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:19:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1582. [2020-02-10 20:19:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:19:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7059 transitions. [2020-02-10 20:19:26,430 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7059 transitions. Word has length 28 [2020-02-10 20:19:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:26,430 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7059 transitions. [2020-02-10 20:19:26,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7059 transitions. [2020-02-10 20:19:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:26,433 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:26,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:26,433 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:26,434 INFO L82 PathProgramCache]: Analyzing trace with hash -646832946, now seen corresponding path program 522 times [2020-02-10 20:19:26,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:26,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160733864] [2020-02-10 20:19:26,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:26,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160733864] [2020-02-10 20:19:26,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:26,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:26,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518503592] [2020-02-10 20:19:26,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:26,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:26,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:26,964 INFO L87 Difference]: Start difference. First operand 1582 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:19:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:27,158 INFO L93 Difference]: Finished difference Result 2985 states and 11800 transitions. [2020-02-10 20:19:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:27,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:27,166 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:19:27,166 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:19:27,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:19:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1570. [2020-02-10 20:19:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:19:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7032 transitions. [2020-02-10 20:19:27,229 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7032 transitions. Word has length 28 [2020-02-10 20:19:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:27,230 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7032 transitions. [2020-02-10 20:19:27,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7032 transitions. [2020-02-10 20:19:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:27,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:27,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:27,232 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:27,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash -801700206, now seen corresponding path program 523 times [2020-02-10 20:19:27,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:27,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588483252] [2020-02-10 20:19:27,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:27,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588483252] [2020-02-10 20:19:27,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:27,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:27,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662376314] [2020-02-10 20:19:27,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:27,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:27,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:27,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:27,785 INFO L87 Difference]: Start difference. First operand 1570 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:19:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:27,929 INFO L93 Difference]: Finished difference Result 3012 states and 11871 transitions. [2020-02-10 20:19:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:27,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:27,936 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:19:27,936 INFO L226 Difference]: Without dead ends: 2992 [2020-02-10 20:19:27,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-02-10 20:19:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1590. [2020-02-10 20:19:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:19:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7082 transitions. [2020-02-10 20:19:28,004 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7082 transitions. Word has length 28 [2020-02-10 20:19:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:28,004 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7082 transitions. [2020-02-10 20:19:28,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7082 transitions. [2020-02-10 20:19:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:28,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:28,007 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:28,007 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:28,007 INFO L82 PathProgramCache]: Analyzing trace with hash -56997708, now seen corresponding path program 524 times [2020-02-10 20:19:28,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:28,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129120460] [2020-02-10 20:19:28,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:28,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129120460] [2020-02-10 20:19:28,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:28,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:28,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193783746] [2020-02-10 20:19:28,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:28,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:28,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:28,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:28,564 INFO L87 Difference]: Start difference. First operand 1590 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:19:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:28,734 INFO L93 Difference]: Finished difference Result 3010 states and 11859 transitions. [2020-02-10 20:19:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:28,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:28,742 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 20:19:28,742 INFO L226 Difference]: Without dead ends: 2982 [2020-02-10 20:19:28,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2020-02-10 20:19:28,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1580. [2020-02-10 20:19:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:19:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7056 transitions. [2020-02-10 20:19:28,806 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7056 transitions. Word has length 28 [2020-02-10 20:19:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:28,806 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7056 transitions. [2020-02-10 20:19:28,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7056 transitions. [2020-02-10 20:19:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:28,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:28,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:28,808 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:28,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1336930008, now seen corresponding path program 525 times [2020-02-10 20:19:28,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:28,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693432518] [2020-02-10 20:19:28,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:29,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693432518] [2020-02-10 20:19:29,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:29,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:29,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040747063] [2020-02-10 20:19:29,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:29,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:29,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:29,411 INFO L87 Difference]: Start difference. First operand 1580 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:19:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:29,548 INFO L93 Difference]: Finished difference Result 3009 states and 11856 transitions. [2020-02-10 20:19:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:29,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:29,555 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:19:29,555 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:19:29,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:19:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1588. [2020-02-10 20:19:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:19:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7070 transitions. [2020-02-10 20:19:29,620 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7070 transitions. Word has length 28 [2020-02-10 20:19:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:29,620 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7070 transitions. [2020-02-10 20:19:29,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7070 transitions. [2020-02-10 20:19:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:29,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:29,623 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:29,623 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:29,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1163682316, now seen corresponding path program 526 times [2020-02-10 20:19:29,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:29,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790808763] [2020-02-10 20:19:29,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:30,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790808763] [2020-02-10 20:19:30,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:30,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:30,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447775672] [2020-02-10 20:19:30,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:30,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:30,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:30,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:30,153 INFO L87 Difference]: Start difference. First operand 1588 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:19:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:30,322 INFO L93 Difference]: Finished difference Result 3006 states and 11843 transitions. [2020-02-10 20:19:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:30,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:30,330 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:19:30,330 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:19:30,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:19:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1580. [2020-02-10 20:19:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:19:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7048 transitions. [2020-02-10 20:19:30,396 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7048 transitions. Word has length 28 [2020-02-10 20:19:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:30,396 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7048 transitions. [2020-02-10 20:19:30,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7048 transitions. [2020-02-10 20:19:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:30,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:30,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:30,399 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:30,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1018713448, now seen corresponding path program 527 times [2020-02-10 20:19:30,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:30,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084792108] [2020-02-10 20:19:30,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:30,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084792108] [2020-02-10 20:19:30,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:30,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:30,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209000390] [2020-02-10 20:19:30,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:30,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:30,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:30,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:30,931 INFO L87 Difference]: Start difference. First operand 1580 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:19:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:31,108 INFO L93 Difference]: Finished difference Result 3004 states and 11840 transitions. [2020-02-10 20:19:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:31,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:31,116 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 20:19:31,117 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 20:19:31,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 20:19:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1587. [2020-02-10 20:19:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:19:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7061 transitions. [2020-02-10 20:19:31,182 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7061 transitions. Word has length 28 [2020-02-10 20:19:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:31,182 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7061 transitions. [2020-02-10 20:19:31,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7061 transitions. [2020-02-10 20:19:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:31,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:31,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:31,185 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:31,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:31,185 INFO L82 PathProgramCache]: Analyzing trace with hash 447258642, now seen corresponding path program 528 times [2020-02-10 20:19:31,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:31,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199288625] [2020-02-10 20:19:31,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:31,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199288625] [2020-02-10 20:19:31,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:31,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:31,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472799786] [2020-02-10 20:19:31,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:31,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:31,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:31,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:31,714 INFO L87 Difference]: Start difference. First operand 1587 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:19:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:31,885 INFO L93 Difference]: Finished difference Result 3003 states and 11831 transitions. [2020-02-10 20:19:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:31,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:31,892 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:19:31,892 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:19:31,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:19:31,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1562. [2020-02-10 20:19:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:19:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7010 transitions. [2020-02-10 20:19:31,956 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7010 transitions. Word has length 28 [2020-02-10 20:19:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:31,956 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7010 transitions. [2020-02-10 20:19:31,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7010 transitions. [2020-02-10 20:19:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:31,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:31,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:31,959 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1933571164, now seen corresponding path program 529 times [2020-02-10 20:19:31,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:31,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081867626] [2020-02-10 20:19:31,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:32,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081867626] [2020-02-10 20:19:32,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:32,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:32,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886245996] [2020-02-10 20:19:32,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:32,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:32,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:32,477 INFO L87 Difference]: Start difference. First operand 1562 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:19:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:32,675 INFO L93 Difference]: Finished difference Result 2955 states and 11734 transitions. [2020-02-10 20:19:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:32,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:32,682 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:19:32,683 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:19:32,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:19:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1578. [2020-02-10 20:19:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:19:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7062 transitions. [2020-02-10 20:19:32,746 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7062 transitions. Word has length 28 [2020-02-10 20:19:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:32,746 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7062 transitions. [2020-02-10 20:19:32,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7062 transitions. [2020-02-10 20:19:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:32,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:32,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:32,749 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:32,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:32,749 INFO L82 PathProgramCache]: Analyzing trace with hash -444166168, now seen corresponding path program 530 times [2020-02-10 20:19:32,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:32,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986881586] [2020-02-10 20:19:32,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:33,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986881586] [2020-02-10 20:19:33,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:33,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:33,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352813878] [2020-02-10 20:19:33,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:33,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:33,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:33,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:33,261 INFO L87 Difference]: Start difference. First operand 1578 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:19:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:33,424 INFO L93 Difference]: Finished difference Result 2960 states and 11738 transitions. [2020-02-10 20:19:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:33,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:33,432 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 20:19:33,432 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:19:33,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:33,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:19:33,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1572. [2020-02-10 20:19:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:19:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7046 transitions. [2020-02-10 20:19:33,496 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7046 transitions. Word has length 28 [2020-02-10 20:19:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:33,496 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7046 transitions. [2020-02-10 20:19:33,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7046 transitions. [2020-02-10 20:19:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:33,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:33,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:33,498 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:33,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:33,498 INFO L82 PathProgramCache]: Analyzing trace with hash 215225372, now seen corresponding path program 531 times [2020-02-10 20:19:33,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:33,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936442032] [2020-02-10 20:19:33,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:34,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936442032] [2020-02-10 20:19:34,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:34,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:34,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182488542] [2020-02-10 20:19:34,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:34,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:34,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:34,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:34,016 INFO L87 Difference]: Start difference. First operand 1572 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:19:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:34,201 INFO L93 Difference]: Finished difference Result 2947 states and 11713 transitions. [2020-02-10 20:19:34,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:34,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:34,209 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:19:34,209 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:19:34,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:19:34,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1576. [2020-02-10 20:19:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:19:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7053 transitions. [2020-02-10 20:19:34,308 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7053 transitions. Word has length 28 [2020-02-10 20:19:34,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:34,308 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7053 transitions. [2020-02-10 20:19:34,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7053 transitions. [2020-02-10 20:19:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:34,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:34,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:34,311 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:34,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:34,311 INFO L82 PathProgramCache]: Analyzing trace with hash 388473064, now seen corresponding path program 532 times [2020-02-10 20:19:34,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:34,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728517706] [2020-02-10 20:19:34,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:34,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728517706] [2020-02-10 20:19:34,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:34,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:34,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392524311] [2020-02-10 20:19:34,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:34,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:34,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:34,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:34,822 INFO L87 Difference]: Start difference. First operand 1576 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:19:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:35,018 INFO L93 Difference]: Finished difference Result 2946 states and 11707 transitions. [2020-02-10 20:19:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:35,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:35,026 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:19:35,026 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:19:35,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:19:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1572. [2020-02-10 20:19:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:19:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7042 transitions. [2020-02-10 20:19:35,091 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7042 transitions. Word has length 28 [2020-02-10 20:19:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:35,091 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7042 transitions. [2020-02-10 20:19:35,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7042 transitions. [2020-02-10 20:19:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:35,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:35,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:35,094 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash 631544988, now seen corresponding path program 533 times [2020-02-10 20:19:35,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:35,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240289749] [2020-02-10 20:19:35,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:35,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240289749] [2020-02-10 20:19:35,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:35,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:35,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566835290] [2020-02-10 20:19:35,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:35,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:35,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:35,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:35,615 INFO L87 Difference]: Start difference. First operand 1572 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:19:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:35,770 INFO L93 Difference]: Finished difference Result 2958 states and 11729 transitions. [2020-02-10 20:19:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:35,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:35,778 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:19:35,778 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:19:35,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:19:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 20:19:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:19:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7050 transitions. [2020-02-10 20:19:35,843 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7050 transitions. Word has length 28 [2020-02-10 20:19:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:35,844 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7050 transitions. [2020-02-10 20:19:35,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7050 transitions. [2020-02-10 20:19:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:35,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:35,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:35,847 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:35,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:35,847 INFO L82 PathProgramCache]: Analyzing trace with hash -684612316, now seen corresponding path program 534 times [2020-02-10 20:19:35,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:35,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257449178] [2020-02-10 20:19:35,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:36,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257449178] [2020-02-10 20:19:36,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:36,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:36,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137556963] [2020-02-10 20:19:36,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:36,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:36,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:36,368 INFO L87 Difference]: Start difference. First operand 1577 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:19:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:36,552 INFO L93 Difference]: Finished difference Result 2952 states and 11713 transitions. [2020-02-10 20:19:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:36,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:36,559 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:19:36,559 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:19:36,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:19:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1567. [2020-02-10 20:19:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:19:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7028 transitions. [2020-02-10 20:19:36,624 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7028 transitions. Word has length 28 [2020-02-10 20:19:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:36,624 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7028 transitions. [2020-02-10 20:19:36,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7028 transitions. [2020-02-10 20:19:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:36,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:36,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:36,627 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:36,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash -839479576, now seen corresponding path program 535 times [2020-02-10 20:19:36,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:36,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206929808] [2020-02-10 20:19:36,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:37,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206929808] [2020-02-10 20:19:37,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:37,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:37,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637149618] [2020-02-10 20:19:37,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:37,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:37,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:37,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:37,162 INFO L87 Difference]: Start difference. First operand 1567 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:19:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:37,359 INFO L93 Difference]: Finished difference Result 2963 states and 11751 transitions. [2020-02-10 20:19:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:37,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:37,366 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:19:37,366 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:19:37,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:19:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1579. [2020-02-10 20:19:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:19:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7061 transitions. [2020-02-10 20:19:37,430 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7061 transitions. Word has length 28 [2020-02-10 20:19:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:37,430 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7061 transitions. [2020-02-10 20:19:37,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7061 transitions. [2020-02-10 20:19:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:37,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:37,432 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:37,433 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:37,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash 649925420, now seen corresponding path program 536 times [2020-02-10 20:19:37,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:37,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261662039] [2020-02-10 20:19:37,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19: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-02-10 20:19:37,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261662039] [2020-02-10 20:19:37,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:37,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:37,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019212577] [2020-02-10 20:19:37,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:37,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:37,953 INFO L87 Difference]: Start difference. First operand 1579 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:19:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:38,152 INFO L93 Difference]: Finished difference Result 2968 states and 11755 transitions. [2020-02-10 20:19:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:38,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:38,159 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:19:38,159 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:19:38,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:19:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1573. [2020-02-10 20:19:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:19:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 20:19:38,224 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 20:19:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:38,224 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 20:19:38,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 20:19:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:38,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:38,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:38,227 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:38,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:38,227 INFO L82 PathProgramCache]: Analyzing trace with hash 236231580, now seen corresponding path program 537 times [2020-02-10 20:19:38,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:38,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538492043] [2020-02-10 20:19:38,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:38,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538492043] [2020-02-10 20:19:38,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:38,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:38,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800421944] [2020-02-10 20:19:38,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:38,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:38,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:38,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:38,745 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:19:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:38,964 INFO L93 Difference]: Finished difference Result 2959 states and 11738 transitions. [2020-02-10 20:19:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:38,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:38,972 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:19:38,972 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:19:38,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:19:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1578. [2020-02-10 20:19:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:19:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7053 transitions. [2020-02-10 20:19:39,035 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7053 transitions. Word has length 28 [2020-02-10 20:19:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:39,036 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7053 transitions. [2020-02-10 20:19:39,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7053 transitions. [2020-02-10 20:19:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:39,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:39,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, 1, 1, 1] [2020-02-10 20:19:39,038 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1898884268, now seen corresponding path program 538 times [2020-02-10 20:19:39,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:39,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909810933] [2020-02-10 20:19:39,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:39,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909810933] [2020-02-10 20:19:39,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:39,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:39,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522767392] [2020-02-10 20:19:39,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:39,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:39,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:39,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:39,554 INFO L87 Difference]: Start difference. First operand 1578 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:19:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:39,800 INFO L93 Difference]: Finished difference Result 2961 states and 11737 transitions. [2020-02-10 20:19:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:39,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:39,807 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:19:39,808 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:19:39,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:19:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1573. [2020-02-10 20:19:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:19:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7039 transitions. [2020-02-10 20:19:39,873 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7039 transitions. Word has length 28 [2020-02-10 20:19:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:39,873 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7039 transitions. [2020-02-10 20:19:39,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7039 transitions. [2020-02-10 20:19:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:39,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:39,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:39,875 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash 652551196, now seen corresponding path program 539 times [2020-02-10 20:19:39,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:39,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762175306] [2020-02-10 20:19:39,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:40,397 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:19:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:40,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762175306] [2020-02-10 20:19:40,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:40,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:40,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575465235] [2020-02-10 20:19:40,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:40,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:40,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:40,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:40,403 INFO L87 Difference]: Start difference. First operand 1573 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:19:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:40,551 INFO L93 Difference]: Finished difference Result 2972 states and 11759 transitions. [2020-02-10 20:19:40,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:40,551 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:40,559 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:19:40,559 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:19:40,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:19:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1581. [2020-02-10 20:19:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:19:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7053 transitions. [2020-02-10 20:19:40,622 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7053 transitions. Word has length 28 [2020-02-10 20:19:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:40,622 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7053 transitions. [2020-02-10 20:19:40,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7053 transitions. [2020-02-10 20:19:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:40,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:40,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:40,625 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash 825798888, now seen corresponding path program 540 times [2020-02-10 20:19:40,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:40,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819376180] [2020-02-10 20:19:40,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:41,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819376180] [2020-02-10 20:19:41,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:41,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:41,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321182948] [2020-02-10 20:19:41,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:41,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:41,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:41,146 INFO L87 Difference]: Start difference. First operand 1581 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:19:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:41,347 INFO L93 Difference]: Finished difference Result 2969 states and 11746 transitions. [2020-02-10 20:19:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:41,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:41,355 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:19:41,355 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:19:41,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:19:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1567. [2020-02-10 20:19:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:19:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7023 transitions. [2020-02-10 20:19:41,420 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7023 transitions. Word has length 28 [2020-02-10 20:19:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:41,420 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7023 transitions. [2020-02-10 20:19:41,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7023 transitions. [2020-02-10 20:19:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:41,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:41,423 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:41,423 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:41,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:41,423 INFO L82 PathProgramCache]: Analyzing trace with hash -797467160, now seen corresponding path program 541 times [2020-02-10 20:19:41,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:41,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348153630] [2020-02-10 20:19:41,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:41,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348153630] [2020-02-10 20:19:41,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:41,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:41,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118168162] [2020-02-10 20:19:41,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:41,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:41,937 INFO L87 Difference]: Start difference. First operand 1567 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:19:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:42,138 INFO L93 Difference]: Finished difference Result 2941 states and 11696 transitions. [2020-02-10 20:19:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:42,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:42,146 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:19:42,146 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:19:42,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:19:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1575. [2020-02-10 20:19:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:19:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7045 transitions. [2020-02-10 20:19:42,211 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7045 transitions. Word has length 28 [2020-02-10 20:19:42,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:42,211 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7045 transitions. [2020-02-10 20:19:42,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7045 transitions. [2020-02-10 20:19:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:42,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:42,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:42,214 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash -624219468, now seen corresponding path program 542 times [2020-02-10 20:19:42,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:42,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601470104] [2020-02-10 20:19:42,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:42,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601470104] [2020-02-10 20:19:42,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:42,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:42,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841189204] [2020-02-10 20:19:42,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:42,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:42,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:42,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:42,731 INFO L87 Difference]: Start difference. First operand 1575 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:19:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:42,903 INFO L93 Difference]: Finished difference Result 2940 states and 11690 transitions. [2020-02-10 20:19:42,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:42,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:42,910 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:19:42,910 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 20:19:42,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 20:19:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1571. [2020-02-10 20:19:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:19:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7034 transitions. [2020-02-10 20:19:42,974 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7034 transitions. Word has length 28 [2020-02-10 20:19:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:42,974 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7034 transitions. [2020-02-10 20:19:42,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7034 transitions. [2020-02-10 20:19:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:42,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:42,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:42,976 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:42,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1870552540, now seen corresponding path program 543 times [2020-02-10 20:19:42,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:42,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615779300] [2020-02-10 20:19:42,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:43,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615779300] [2020-02-10 20:19:43,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:43,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:43,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585874465] [2020-02-10 20:19:43,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:43,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:43,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:43,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:43,504 INFO L87 Difference]: Start difference. First operand 1571 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:19:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:43,678 INFO L93 Difference]: Finished difference Result 2945 states and 11701 transitions. [2020-02-10 20:19:43,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:43,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:43,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:43,685 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:19:43,685 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:19:43,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:19:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:19:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:19:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7043 transitions. [2020-02-10 20:19:43,750 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7043 transitions. Word has length 28 [2020-02-10 20:19:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:43,750 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7043 transitions. [2020-02-10 20:19:43,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7043 transitions. [2020-02-10 20:19:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:43,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:43,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, 1, 1, 1] [2020-02-10 20:19:43,753 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash -207899852, now seen corresponding path program 544 times [2020-02-10 20:19:43,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:43,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328563389] [2020-02-10 20:19:43,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:44,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328563389] [2020-02-10 20:19:44,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:44,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:44,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504484643] [2020-02-10 20:19:44,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:44,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:44,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:44,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:44,266 INFO L87 Difference]: Start difference. First operand 1576 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:19:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:44,459 INFO L93 Difference]: Finished difference Result 2947 states and 11700 transitions. [2020-02-10 20:19:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:44,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:44,467 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:19:44,467 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:19:44,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:19:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 20:19:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:19:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7030 transitions. [2020-02-10 20:19:44,532 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7030 transitions. Word has length 28 [2020-02-10 20:19:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:44,532 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7030 transitions. [2020-02-10 20:19:44,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7030 transitions. [2020-02-10 20:19:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:44,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:44,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:44,534 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:44,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:44,535 INFO L82 PathProgramCache]: Analyzing trace with hash -621593692, now seen corresponding path program 545 times [2020-02-10 20:19:44,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:44,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334658969] [2020-02-10 20:19:44,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:44,964 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2020-02-10 20:19:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:45,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334658969] [2020-02-10 20:19:45,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:45,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:45,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639450010] [2020-02-10 20:19:45,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:45,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:45,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:45,086 INFO L87 Difference]: Start difference. First operand 1571 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:19:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:45,291 INFO L93 Difference]: Finished difference Result 2942 states and 11690 transitions. [2020-02-10 20:19:45,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:45,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:45,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:45,299 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:19:45,299 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:19:45,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:19:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1575. [2020-02-10 20:19:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:19:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7037 transitions. [2020-02-10 20:19:45,365 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7037 transitions. Word has length 28 [2020-02-10 20:19:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:45,365 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7037 transitions. [2020-02-10 20:19:45,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7037 transitions. [2020-02-10 20:19:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:45,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:45,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:45,368 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:45,368 INFO L82 PathProgramCache]: Analyzing trace with hash 867811304, now seen corresponding path program 546 times [2020-02-10 20:19:45,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:45,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683384982] [2020-02-10 20:19:45,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:45,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683384982] [2020-02-10 20:19:45,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:45,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:45,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248711088] [2020-02-10 20:19:45,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:45,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:45,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:45,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:45,877 INFO L87 Difference]: Start difference. First operand 1575 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:19:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:46,085 INFO L93 Difference]: Finished difference Result 2945 states and 11692 transitions. [2020-02-10 20:19:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:46,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:46,092 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:19:46,092 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:19:46,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:19:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1567. [2020-02-10 20:19:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:19:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7019 transitions. [2020-02-10 20:19:46,155 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7019 transitions. Word has length 28 [2020-02-10 20:19:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:46,155 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7019 transitions. [2020-02-10 20:19:46,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7019 transitions. [2020-02-10 20:19:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:46,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:46,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:46,158 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:46,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:46,158 INFO L82 PathProgramCache]: Analyzing trace with hash 712944044, now seen corresponding path program 547 times [2020-02-10 20:19:46,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:46,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201533805] [2020-02-10 20:19:46,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:46,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201533805] [2020-02-10 20:19:46,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:46,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:46,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580431269] [2020-02-10 20:19:46,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:46,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:46,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:46,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:46,671 INFO L87 Difference]: Start difference. First operand 1567 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:19:46,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:46,838 INFO L93 Difference]: Finished difference Result 2962 states and 11734 transitions. [2020-02-10 20:19:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:46,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:46,847 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:19:46,847 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:19:46,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:19:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1577. [2020-02-10 20:19:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:19:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7045 transitions. [2020-02-10 20:19:46,912 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7045 transitions. Word has length 28 [2020-02-10 20:19:46,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:46,912 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7045 transitions. [2020-02-10 20:19:46,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7045 transitions. [2020-02-10 20:19:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:46,915 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:46,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, 1, 1, 1] [2020-02-10 20:19:46,915 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:46,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash -603213260, now seen corresponding path program 548 times [2020-02-10 20:19:46,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:46,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306059067] [2020-02-10 20:19:46,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:47,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306059067] [2020-02-10 20:19:47,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:47,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:47,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413039986] [2020-02-10 20:19:47,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:47,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:47,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:47,419 INFO L87 Difference]: Start difference. First operand 1577 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:19:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:47,638 INFO L93 Difference]: Finished difference Result 2956 states and 11718 transitions. [2020-02-10 20:19:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:47,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:47,646 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:19:47,646 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:19:47,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:19:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1572. [2020-02-10 20:19:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:19:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7032 transitions. [2020-02-10 20:19:47,710 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7032 transitions. Word has length 28 [2020-02-10 20:19:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:47,710 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7032 transitions. [2020-02-10 20:19:47,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7032 transitions. [2020-02-10 20:19:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:47,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:47,712 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:47,712 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash -360141336, now seen corresponding path program 549 times [2020-02-10 20:19:47,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:47,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766117587] [2020-02-10 20:19:47,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:48,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766117587] [2020-02-10 20:19:48,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:48,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:48,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868007746] [2020-02-10 20:19:48,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:48,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:48,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:48,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:48,229 INFO L87 Difference]: Start difference. First operand 1572 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:19:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:48,399 INFO L93 Difference]: Finished difference Result 2968 states and 11744 transitions. [2020-02-10 20:19:48,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:48,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:48,406 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:19:48,407 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:19:48,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:19:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1580. [2020-02-10 20:19:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:19:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7046 transitions. [2020-02-10 20:19:48,472 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7046 transitions. Word has length 28 [2020-02-10 20:19:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:48,472 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7046 transitions. [2020-02-10 20:19:48,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7046 transitions. [2020-02-10 20:19:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:48,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:48,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:48,474 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:48,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash -186893644, now seen corresponding path program 550 times [2020-02-10 20:19:48,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:48,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532679313] [2020-02-10 20:19:48,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:48,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532679313] [2020-02-10 20:19:48,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:48,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:48,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060299569] [2020-02-10 20:19:48,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:48,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:48,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:48,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:48,993 INFO L87 Difference]: Start difference. First operand 1580 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:19:49,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:49,245 INFO L93 Difference]: Finished difference Result 2965 states and 11731 transitions. [2020-02-10 20:19:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:49,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:49,253 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:19:49,254 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:19:49,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:19:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1572. [2020-02-10 20:19:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:19:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7027 transitions. [2020-02-10 20:19:49,319 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7027 transitions. Word has length 28 [2020-02-10 20:19:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:49,319 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7027 transitions. [2020-02-10 20:19:49,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7027 transitions. [2020-02-10 20:19:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:49,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:49,321 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:49,321 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:49,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:49,321 INFO L82 PathProgramCache]: Analyzing trace with hash 472497896, now seen corresponding path program 551 times [2020-02-10 20:19:49,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:49,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456350062] [2020-02-10 20:19:49,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:49,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456350062] [2020-02-10 20:19:49,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:49,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:49,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079527526] [2020-02-10 20:19:49,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:49,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:49,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:49,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:49,839 INFO L87 Difference]: Start difference. First operand 1572 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:19:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:50,030 INFO L93 Difference]: Finished difference Result 2952 states and 11706 transitions. [2020-02-10 20:19:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:50,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:50,037 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:19:50,037 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:19:50,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:19:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1576. [2020-02-10 20:19:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:19:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7034 transitions. [2020-02-10 20:19:50,101 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7034 transitions. Word has length 28 [2020-02-10 20:19:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:50,101 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7034 transitions. [2020-02-10 20:19:50,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7034 transitions. [2020-02-10 20:19:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:50,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:50,103 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:50,103 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1961902892, now seen corresponding path program 552 times [2020-02-10 20:19:50,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:50,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999073162] [2020-02-10 20:19:50,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:50,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999073162] [2020-02-10 20:19:50,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:50,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:50,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226990745] [2020-02-10 20:19:50,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:50,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:50,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:50,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:50,656 INFO L87 Difference]: Start difference. First operand 1576 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:19:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:50,919 INFO L93 Difference]: Finished difference Result 2955 states and 11708 transitions. [2020-02-10 20:19:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:50,920 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:50,927 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:19:50,927 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:19:50,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:19:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1562. [2020-02-10 20:19:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:19:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7005 transitions. [2020-02-10 20:19:50,990 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7005 transitions. Word has length 28 [2020-02-10 20:19:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:50,990 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7005 transitions. [2020-02-10 20:19:50,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7005 transitions. [2020-02-10 20:19:50,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:50,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:50,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:50,993 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:50,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:50,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2966018, now seen corresponding path program 553 times [2020-02-10 20:19:50,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:50,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800169859] [2020-02-10 20:19:50,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:51,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800169859] [2020-02-10 20:19:51,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:51,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:51,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130667336] [2020-02-10 20:19:51,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:51,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:51,502 INFO L87 Difference]: Start difference. First operand 1562 states and 7005 transitions. Second operand 11 states. [2020-02-10 20:19:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:51,720 INFO L93 Difference]: Finished difference Result 2938 states and 11692 transitions. [2020-02-10 20:19:51,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:51,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:51,727 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:19:51,727 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 20:19:51,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 20:19:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1575. [2020-02-10 20:19:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:19:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7048 transitions. [2020-02-10 20:19:51,790 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7048 transitions. Word has length 28 [2020-02-10 20:19:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:51,791 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7048 transitions. [2020-02-10 20:19:51,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7048 transitions. [2020-02-10 20:19:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:51,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:51,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:51,793 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:51,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:51,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2057893784, now seen corresponding path program 554 times [2020-02-10 20:19:51,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:51,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112835258] [2020-02-10 20:19:51,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:52,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112835258] [2020-02-10 20:19:52,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:52,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:52,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704882972] [2020-02-10 20:19:52,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:52,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:52,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:52,310 INFO L87 Difference]: Start difference. First operand 1575 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:19:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:52,576 INFO L93 Difference]: Finished difference Result 2941 states and 11693 transitions. [2020-02-10 20:19:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:52,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:52,583 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:19:52,584 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:19:52,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:19:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1570. [2020-02-10 20:19:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:19:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7035 transitions. [2020-02-10 20:19:52,647 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7035 transitions. Word has length 28 [2020-02-10 20:19:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:52,647 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7035 transitions. [2020-02-10 20:19:52,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7035 transitions. [2020-02-10 20:19:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:52,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:52,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:52,649 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:52,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:52,650 INFO L82 PathProgramCache]: Analyzing trace with hash 540821596, now seen corresponding path program 555 times [2020-02-10 20:19:52,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:52,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705195577] [2020-02-10 20:19:52,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:53,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705195577] [2020-02-10 20:19:53,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:53,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:53,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069693780] [2020-02-10 20:19:53,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:53,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:53,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:53,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:53,167 INFO L87 Difference]: Start difference. First operand 1570 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:19:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:53,436 INFO L93 Difference]: Finished difference Result 2933 states and 11677 transitions. [2020-02-10 20:19:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:53,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:53,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:53,444 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:19:53,444 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:19:53,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:19:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1574. [2020-02-10 20:19:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:19:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7042 transitions. [2020-02-10 20:19:53,507 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7042 transitions. Word has length 28 [2020-02-10 20:19:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:53,507 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7042 transitions. [2020-02-10 20:19:53,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7042 transitions. [2020-02-10 20:19:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:53,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:53,509 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:53,510 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:53,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash 714069288, now seen corresponding path program 556 times [2020-02-10 20:19:53,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:53,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001060337] [2020-02-10 20:19:53,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:54,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001060337] [2020-02-10 20:19:54,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:54,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:54,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432875690] [2020-02-10 20:19:54,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:54,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:54,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:54,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:54,034 INFO L87 Difference]: Start difference. First operand 1574 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:19:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:54,275 INFO L93 Difference]: Finished difference Result 2932 states and 11671 transitions. [2020-02-10 20:19:54,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:54,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:54,283 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:19:54,283 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:19:54,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:19:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1570. [2020-02-10 20:19:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:19:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7031 transitions. [2020-02-10 20:19:54,346 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7031 transitions. Word has length 28 [2020-02-10 20:19:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:54,346 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7031 transitions. [2020-02-10 20:19:54,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7031 transitions. [2020-02-10 20:19:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:54,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:54,349 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:54,349 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:54,349 INFO L82 PathProgramCache]: Analyzing trace with hash -982182628, now seen corresponding path program 557 times [2020-02-10 20:19:54,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:54,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960746714] [2020-02-10 20:19:54,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:54,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960746714] [2020-02-10 20:19:54,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:54,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:54,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399417485] [2020-02-10 20:19:54,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:54,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:54,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:54,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:54,863 INFO L87 Difference]: Start difference. First operand 1570 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:19:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:55,118 INFO L93 Difference]: Finished difference Result 2939 states and 11685 transitions. [2020-02-10 20:19:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:55,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:55,125 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:19:55,125 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:19:55,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:19:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1574. [2020-02-10 20:19:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:19:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7038 transitions. [2020-02-10 20:19:55,189 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7038 transitions. Word has length 28 [2020-02-10 20:19:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:55,189 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7038 transitions. [2020-02-10 20:19:55,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7038 transitions. [2020-02-10 20:19:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:55,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:55,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:55,191 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1251924866, now seen corresponding path program 558 times [2020-02-10 20:19:55,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:55,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956874457] [2020-02-10 20:19:55,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:55,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956874457] [2020-02-10 20:19:55,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:55,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:55,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991609605] [2020-02-10 20:19:55,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:55,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:55,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:55,706 INFO L87 Difference]: Start difference. First operand 1574 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:19:55,982 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2020-02-10 20:19:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:56,000 INFO L93 Difference]: Finished difference Result 2935 states and 11673 transitions. [2020-02-10 20:19:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:56,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:56,008 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 20:19:56,008 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:19:56,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:19:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1566. [2020-02-10 20:19:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:19:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7020 transitions. [2020-02-10 20:19:56,071 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7020 transitions. Word has length 28 [2020-02-10 20:19:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:56,071 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7020 transitions. [2020-02-10 20:19:56,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7020 transitions. [2020-02-10 20:19:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:56,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:56,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:56,073 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1097057606, now seen corresponding path program 559 times [2020-02-10 20:19:56,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:56,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630215405] [2020-02-10 20:19:56,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:56,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630215405] [2020-02-10 20:19:56,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:56,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:56,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097277641] [2020-02-10 20:19:56,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:56,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:56,585 INFO L87 Difference]: Start difference. First operand 1566 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:19:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:56,848 INFO L93 Difference]: Finished difference Result 2946 states and 11710 transitions. [2020-02-10 20:19:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:56,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:56,856 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:19:56,857 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 20:19:56,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 20:19:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1576. [2020-02-10 20:19:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:19:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7048 transitions. [2020-02-10 20:19:56,920 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7048 transitions. Word has length 28 [2020-02-10 20:19:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:56,921 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7048 transitions. [2020-02-10 20:19:56,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7048 transitions. [2020-02-10 20:19:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:56,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:56,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:56,923 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash -963802196, now seen corresponding path program 560 times [2020-02-10 20:19:56,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:56,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60239418] [2020-02-10 20:19:56,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:57,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60239418] [2020-02-10 20:19:57,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:57,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:57,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356360054] [2020-02-10 20:19:57,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:57,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:57,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:57,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:57,436 INFO L87 Difference]: Start difference. First operand 1576 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:19:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:57,697 INFO L93 Difference]: Finished difference Result 2949 states and 11711 transitions. [2020-02-10 20:19:57,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:57,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:57,705 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:19:57,705 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:19:57,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:19:57,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1571. [2020-02-10 20:19:57,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:19:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7034 transitions. [2020-02-10 20:19:57,768 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7034 transitions. Word has length 28 [2020-02-10 20:19:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:57,769 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7034 transitions. [2020-02-10 20:19:57,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7034 transitions. [2020-02-10 20:19:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:57,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:57,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:57,771 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:57,771 INFO L82 PathProgramCache]: Analyzing trace with hash 561827804, now seen corresponding path program 561 times [2020-02-10 20:19:57,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:57,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496553571] [2020-02-10 20:19:57,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:58,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496553571] [2020-02-10 20:19:58,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:58,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:58,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208510663] [2020-02-10 20:19:58,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:58,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:58,275 INFO L87 Difference]: Start difference. First operand 1571 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:19:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:58,447 INFO L93 Difference]: Finished difference Result 2945 states and 11703 transitions. [2020-02-10 20:19:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:58,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:58,454 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:19:58,455 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:19:58,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:19:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:19:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:19:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7043 transitions. [2020-02-10 20:19:58,518 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7043 transitions. Word has length 28 [2020-02-10 20:19:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:58,518 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7043 transitions. [2020-02-10 20:19:58,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7043 transitions. [2020-02-10 20:19:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:58,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:58,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, 1, 1, 1] [2020-02-10 20:19:58,521 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:58,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:58,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2070486804, now seen corresponding path program 562 times [2020-02-10 20:19:58,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:58,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808873344] [2020-02-10 20:19:58,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:59,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808873344] [2020-02-10 20:19:59,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:59,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:59,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172209512] [2020-02-10 20:19:59,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:59,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:59,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:59,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:59,039 INFO L87 Difference]: Start difference. First operand 1576 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:19:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:59,217 INFO L93 Difference]: Finished difference Result 2947 states and 11702 transitions. [2020-02-10 20:19:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:59,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:59,225 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:19:59,225 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:19:59,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:19:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:19:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 20:19:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:19:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7029 transitions. [2020-02-10 20:19:59,288 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7029 transitions. Word has length 28 [2020-02-10 20:19:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:59,288 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7029 transitions. [2020-02-10 20:19:59,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:19:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7029 transitions. [2020-02-10 20:19:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:19:59,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:59,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:59,291 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:59,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash -961176420, now seen corresponding path program 563 times [2020-02-10 20:19:59,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:59,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968027014] [2020-02-10 20:19:59,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:59,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968027014] [2020-02-10 20:19:59,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:59,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:19:59,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350873753] [2020-02-10 20:19:59,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:19:59,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:59,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:19:59,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:59,816 INFO L87 Difference]: Start difference. First operand 1571 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:19:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:59,981 INFO L93 Difference]: Finished difference Result 2953 states and 11716 transitions. [2020-02-10 20:19:59,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:19:59,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:19:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:59,988 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:19:59,989 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:19:59,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:00,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:20:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1578. [2020-02-10 20:20:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:20:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7042 transitions. [2020-02-10 20:20:00,052 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7042 transitions. Word has length 28 [2020-02-10 20:20:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:00,052 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7042 transitions. [2020-02-10 20:20:00,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7042 transitions. [2020-02-10 20:20:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:00,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:00,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:00,054 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:00,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:00,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1532631226, now seen corresponding path program 564 times [2020-02-10 20:20:00,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:00,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745668003] [2020-02-10 20:20:00,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:00,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745668003] [2020-02-10 20:20:00,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:00,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:00,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191691594] [2020-02-10 20:20:00,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:00,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:00,584 INFO L87 Difference]: Start difference. First operand 1578 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:20:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:00,760 INFO L93 Difference]: Finished difference Result 2952 states and 11707 transitions. [2020-02-10 20:20:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:00,760 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:00,768 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:20:00,768 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 20:20:00,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 20:20:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1566. [2020-02-10 20:20:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:20:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7016 transitions. [2020-02-10 20:20:00,831 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7016 transitions. Word has length 28 [2020-02-10 20:20:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:00,832 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7016 transitions. [2020-02-10 20:20:00,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7016 transitions. [2020-02-10 20:20:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:00,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:00,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:00,834 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:00,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1128566918, now seen corresponding path program 565 times [2020-02-10 20:20:00,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:00,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053943954] [2020-02-10 20:20:00,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:01,381 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:20:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:01,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053943954] [2020-02-10 20:20:01,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:01,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:01,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132932389] [2020-02-10 20:20:01,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:01,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:01,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:01,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:01,392 INFO L87 Difference]: Start difference. First operand 1566 states and 7016 transitions. Second operand 11 states. [2020-02-10 20:20:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:01,584 INFO L93 Difference]: Finished difference Result 2932 states and 11671 transitions. [2020-02-10 20:20:01,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:01,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:01,591 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:20:01,591 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 20:20:01,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 20:20:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1574. [2020-02-10 20:20:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:20:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7038 transitions. [2020-02-10 20:20:01,656 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7038 transitions. Word has length 28 [2020-02-10 20:20:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:01,656 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7038 transitions. [2020-02-10 20:20:01,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7038 transitions. [2020-02-10 20:20:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:01,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:01,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, 1, 1, 1] [2020-02-10 20:20:01,659 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1301814610, now seen corresponding path program 566 times [2020-02-10 20:20:01,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:01,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884734170] [2020-02-10 20:20:01,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:02,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884734170] [2020-02-10 20:20:02,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:02,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:02,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067135345] [2020-02-10 20:20:02,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:02,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:02,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:02,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:02,179 INFO L87 Difference]: Start difference. First operand 1574 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:20:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:02,365 INFO L93 Difference]: Finished difference Result 2931 states and 11665 transitions. [2020-02-10 20:20:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:02,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:02,373 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 20:20:02,373 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:20:02,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:20:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1570. [2020-02-10 20:20:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:20:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7027 transitions. [2020-02-10 20:20:02,439 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7027 transitions. Word has length 28 [2020-02-10 20:20:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:02,439 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7027 transitions. [2020-02-10 20:20:02,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7027 transitions. [2020-02-10 20:20:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:02,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:02,442 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:02,442 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:02,442 INFO L82 PathProgramCache]: Analyzing trace with hash 55481538, now seen corresponding path program 567 times [2020-02-10 20:20:02,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:02,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961621263] [2020-02-10 20:20:02,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:02,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961621263] [2020-02-10 20:20:02,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:02,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:02,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114903264] [2020-02-10 20:20:02,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:02,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:02,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:02,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:02,965 INFO L87 Difference]: Start difference. First operand 1570 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:20:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:03,131 INFO L93 Difference]: Finished difference Result 2936 states and 11676 transitions. [2020-02-10 20:20:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:03,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:03,139 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 20:20:03,139 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:20:03,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:20:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1575. [2020-02-10 20:20:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:20:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7036 transitions. [2020-02-10 20:20:03,204 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7036 transitions. Word has length 28 [2020-02-10 20:20:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:03,205 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7036 transitions. [2020-02-10 20:20:03,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7036 transitions. [2020-02-10 20:20:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:03,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:03,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:03,207 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1718134226, now seen corresponding path program 568 times [2020-02-10 20:20:03,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:03,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368723188] [2020-02-10 20:20:03,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:03,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368723188] [2020-02-10 20:20:03,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:03,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:03,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797466728] [2020-02-10 20:20:03,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:03,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:03,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:03,734 INFO L87 Difference]: Start difference. First operand 1575 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:20:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:03,905 INFO L93 Difference]: Finished difference Result 2938 states and 11675 transitions. [2020-02-10 20:20:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:03,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:03,913 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:20:03,913 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:20:03,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:20:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1570. [2020-02-10 20:20:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:20:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7023 transitions. [2020-02-10 20:20:03,977 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7023 transitions. Word has length 28 [2020-02-10 20:20:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:03,977 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7023 transitions. [2020-02-10 20:20:03,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7023 transitions. [2020-02-10 20:20:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:03,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:03,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:03,979 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1304440386, now seen corresponding path program 569 times [2020-02-10 20:20:03,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:03,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375176512] [2020-02-10 20:20:03,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:04,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375176512] [2020-02-10 20:20:04,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:04,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:04,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13545570] [2020-02-10 20:20:04,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:04,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:04,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:04,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:04,497 INFO L87 Difference]: Start difference. First operand 1570 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:20:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:04,671 INFO L93 Difference]: Finished difference Result 2933 states and 11665 transitions. [2020-02-10 20:20:04,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:04,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:04,678 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:20:04,678 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 20:20:04,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:04,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 20:20:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1574. [2020-02-10 20:20:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:20:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7030 transitions. [2020-02-10 20:20:04,743 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7030 transitions. Word has length 28 [2020-02-10 20:20:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:04,743 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7030 transitions. [2020-02-10 20:20:04,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7030 transitions. [2020-02-10 20:20:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:04,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:04,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:04,746 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1501121914, now seen corresponding path program 570 times [2020-02-10 20:20:04,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:04,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615470925] [2020-02-10 20:20:04,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:05,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615470925] [2020-02-10 20:20:05,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:05,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:05,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868415046] [2020-02-10 20:20:05,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:05,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:05,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:05,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:05,266 INFO L87 Difference]: Start difference. First operand 1574 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:20:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:05,455 INFO L93 Difference]: Finished difference Result 2936 states and 11667 transitions. [2020-02-10 20:20:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:05,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:05,463 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 20:20:05,463 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:20:05,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:20:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1566. [2020-02-10 20:20:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:20:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7012 transitions. [2020-02-10 20:20:05,526 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7012 transitions. Word has length 28 [2020-02-10 20:20:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:05,527 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7012 transitions. [2020-02-10 20:20:05,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7012 transitions. [2020-02-10 20:20:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:05,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:05,529 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:05,529 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:05,529 INFO L82 PathProgramCache]: Analyzing trace with hash -900783572, now seen corresponding path program 571 times [2020-02-10 20:20:05,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:05,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413560416] [2020-02-10 20:20:05,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:06,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-02-10 20:20:06,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413560416] [2020-02-10 20:20:06,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:06,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:06,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068761228] [2020-02-10 20:20:06,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:06,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:06,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:06,048 INFO L87 Difference]: Start difference. First operand 1566 states and 7012 transitions. Second operand 11 states. [2020-02-10 20:20:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:06,224 INFO L93 Difference]: Finished difference Result 2943 states and 11691 transitions. [2020-02-10 20:20:06,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:06,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:06,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:06,231 INFO L225 Difference]: With dead ends: 2943 [2020-02-10 20:20:06,232 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:20:06,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:06,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:20:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1574. [2020-02-10 20:20:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:20:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7034 transitions. [2020-02-10 20:20:06,297 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7034 transitions. Word has length 28 [2020-02-10 20:20:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:06,297 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7034 transitions. [2020-02-10 20:20:06,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7034 transitions. [2020-02-10 20:20:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:06,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:06,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:06,299 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1333323922, now seen corresponding path program 572 times [2020-02-10 20:20:06,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:06,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608588795] [2020-02-10 20:20:06,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:06,729 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2020-02-10 20:20:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:06,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608588795] [2020-02-10 20:20:06,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:06,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:06,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529262198] [2020-02-10 20:20:06,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:06,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:06,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:06,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:06,850 INFO L87 Difference]: Start difference. First operand 1574 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:20:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:07,029 INFO L93 Difference]: Finished difference Result 2939 states and 11679 transitions. [2020-02-10 20:20:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:07,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:07,036 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:20:07,036 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:20:07,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:20:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1570. [2020-02-10 20:20:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:20:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7023 transitions. [2020-02-10 20:20:07,099 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7023 transitions. Word has length 28 [2020-02-10 20:20:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:07,099 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7023 transitions. [2020-02-10 20:20:07,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7023 transitions. [2020-02-10 20:20:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:07,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:07,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, 1, 1, 1] [2020-02-10 20:20:07,102 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1973868952, now seen corresponding path program 573 times [2020-02-10 20:20:07,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:07,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344397725] [2020-02-10 20:20:07,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:07,624 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:20:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:07,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344397725] [2020-02-10 20:20:07,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:07,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:07,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857414749] [2020-02-10 20:20:07,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:07,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:07,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:07,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:07,632 INFO L87 Difference]: Start difference. First operand 1570 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:20:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:07,807 INFO L93 Difference]: Finished difference Result 2949 states and 11702 transitions. [2020-02-10 20:20:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:07,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:07,814 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:20:07,815 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 20:20:07,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 20:20:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1577. [2020-02-10 20:20:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:20:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7036 transitions. [2020-02-10 20:20:07,878 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7036 transitions. Word has length 28 [2020-02-10 20:20:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:07,878 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7036 transitions. [2020-02-10 20:20:07,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7036 transitions. [2020-02-10 20:20:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:07,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:07,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:07,881 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:07,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1749643538, now seen corresponding path program 574 times [2020-02-10 20:20:07,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:07,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986335021] [2020-02-10 20:20:07,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:08,408 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:20:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:08,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986335021] [2020-02-10 20:20:08,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:08,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:08,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207620146] [2020-02-10 20:20:08,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:08,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:08,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:08,414 INFO L87 Difference]: Start difference. First operand 1577 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:20:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:08,588 INFO L93 Difference]: Finished difference Result 2948 states and 11693 transitions. [2020-02-10 20:20:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:08,588 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:08,595 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:20:08,596 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:20:08,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:20:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1570. [2020-02-10 20:20:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:20:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7019 transitions. [2020-02-10 20:20:08,668 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7019 transitions. Word has length 28 [2020-02-10 20:20:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:08,668 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7019 transitions. [2020-02-10 20:20:08,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7019 transitions. [2020-02-10 20:20:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:08,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:08,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:08,671 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:08,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:08,671 INFO L82 PathProgramCache]: Analyzing trace with hash 798094120, now seen corresponding path program 575 times [2020-02-10 20:20:08,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:08,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114356474] [2020-02-10 20:20:08,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:09,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114356474] [2020-02-10 20:20:09,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:09,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:09,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35780240] [2020-02-10 20:20:09,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:09,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:09,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:09,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:09,192 INFO L87 Difference]: Start difference. First operand 1570 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:20:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:09,405 INFO L93 Difference]: Finished difference Result 2938 states and 11673 transitions. [2020-02-10 20:20:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:09,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:09,412 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:20:09,412 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:20:09,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:20:09,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1574. [2020-02-10 20:20:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:20:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7026 transitions. [2020-02-10 20:20:09,476 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7026 transitions. Word has length 28 [2020-02-10 20:20:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:09,476 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7026 transitions. [2020-02-10 20:20:09,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7026 transitions. [2020-02-10 20:20:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:09,478 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:09,479 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:09,479 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:09,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:09,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2007468180, now seen corresponding path program 576 times [2020-02-10 20:20:09,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:09,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987078340] [2020-02-10 20:20:09,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:10,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987078340] [2020-02-10 20:20:10,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:10,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:10,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123837380] [2020-02-10 20:20:10,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:10,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:10,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:10,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:10,005 INFO L87 Difference]: Start difference. First operand 1574 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:20:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:10,215 INFO L93 Difference]: Finished difference Result 2941 states and 11675 transitions. [2020-02-10 20:20:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:10,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:10,222 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:20:10,223 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:20:10,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:20:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1562. [2020-02-10 20:20:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:20:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7001 transitions. [2020-02-10 20:20:10,286 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7001 transitions. Word has length 28 [2020-02-10 20:20:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:10,286 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7001 transitions. [2020-02-10 20:20:10,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7001 transitions. [2020-02-10 20:20:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:10,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:10,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:10,288 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:10,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1070478082, now seen corresponding path program 577 times [2020-02-10 20:20:10,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:10,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888257821] [2020-02-10 20:20:10,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:10,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888257821] [2020-02-10 20:20:10,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:10,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:10,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678740672] [2020-02-10 20:20:10,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:10,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:10,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:10,832 INFO L87 Difference]: Start difference. First operand 1562 states and 7001 transitions. Second operand 11 states. [2020-02-10 20:20:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:11,024 INFO L93 Difference]: Finished difference Result 2991 states and 11808 transitions. [2020-02-10 20:20:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:11,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:11,032 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:20:11,032 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:20:11,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:20:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1585. [2020-02-10 20:20:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:20:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7066 transitions. [2020-02-10 20:20:11,103 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7066 transitions. Word has length 28 [2020-02-10 20:20:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:11,103 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7066 transitions. [2020-02-10 20:20:11,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7066 transitions. [2020-02-10 20:20:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:11,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:11,106 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:11,106 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1815180580, now seen corresponding path program 578 times [2020-02-10 20:20:11,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:11,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009795740] [2020-02-10 20:20:11,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:11,646 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:20:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:11,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009795740] [2020-02-10 20:20:11,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:11,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:11,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194785845] [2020-02-10 20:20:11,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:11,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:11,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:11,654 INFO L87 Difference]: Start difference. First operand 1585 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:20:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:11,832 INFO L93 Difference]: Finished difference Result 2989 states and 11796 transitions. [2020-02-10 20:20:11,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:11,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:11,840 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:20:11,840 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:20:11,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:20:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 20:20:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:20:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7043 transitions. [2020-02-10 20:20:11,904 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7043 transitions. Word has length 28 [2020-02-10 20:20:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:11,904 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7043 transitions. [2020-02-10 20:20:11,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7043 transitions. [2020-02-10 20:20:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:11,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:11,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:11,906 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:11,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1608333660, now seen corresponding path program 579 times [2020-02-10 20:20:11,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:11,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464983310] [2020-02-10 20:20:11,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:12,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464983310] [2020-02-10 20:20:12,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:12,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:12,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935606367] [2020-02-10 20:20:12,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:12,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:12,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:12,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:12,463 INFO L87 Difference]: Start difference. First operand 1575 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:20:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:12,594 INFO L93 Difference]: Finished difference Result 2982 states and 11781 transitions. [2020-02-10 20:20:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:12,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:12,601 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:20:12,601 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:20:12,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:20:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1580. [2020-02-10 20:20:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:20:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7051 transitions. [2020-02-10 20:20:12,664 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7051 transitions. Word has length 28 [2020-02-10 20:20:12,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:12,665 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7051 transitions. [2020-02-10 20:20:12,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7051 transitions. [2020-02-10 20:20:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:12,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:12,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:12,667 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash 292176356, now seen corresponding path program 580 times [2020-02-10 20:20:12,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:12,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949474799] [2020-02-10 20:20:12,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:13,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949474799] [2020-02-10 20:20:13,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:13,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:13,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740955012] [2020-02-10 20:20:13,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:13,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:13,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:13,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:13,177 INFO L87 Difference]: Start difference. First operand 1580 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:20:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:13,386 INFO L93 Difference]: Finished difference Result 2976 states and 11765 transitions. [2020-02-10 20:20:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:13,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:13,394 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:20:13,394 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:20:13,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:20:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1575. [2020-02-10 20:20:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:20:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7038 transitions. [2020-02-10 20:20:13,457 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7038 transitions. Word has length 28 [2020-02-10 20:20:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:13,458 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7038 transitions. [2020-02-10 20:20:13,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7038 transitions. [2020-02-10 20:20:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:13,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:13,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:13,460 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:13,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:13,460 INFO L82 PathProgramCache]: Analyzing trace with hash -330990180, now seen corresponding path program 581 times [2020-02-10 20:20:13,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:13,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389487288] [2020-02-10 20:20:13,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:13,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389487288] [2020-02-10 20:20:13,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:13,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:13,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155283807] [2020-02-10 20:20:13,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:13,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:13,974 INFO L87 Difference]: Start difference. First operand 1575 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:20:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:14,158 INFO L93 Difference]: Finished difference Result 2977 states and 11768 transitions. [2020-02-10 20:20:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:14,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:14,166 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:20:14,166 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:20:14,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:20:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1579. [2020-02-10 20:20:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:20:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7045 transitions. [2020-02-10 20:20:14,230 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7045 transitions. Word has length 28 [2020-02-10 20:20:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:14,230 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7045 transitions. [2020-02-10 20:20:14,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7045 transitions. [2020-02-10 20:20:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:14,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:14,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:14,232 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:14,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:14,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1903117314, now seen corresponding path program 582 times [2020-02-10 20:20:14,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:14,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24784615] [2020-02-10 20:20:14,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:14,748 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:20:14,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-02-10 20:20:14,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24784615] [2020-02-10 20:20:14,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:14,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:14,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195305074] [2020-02-10 20:20:14,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:14,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:14,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:14,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:14,756 INFO L87 Difference]: Start difference. First operand 1579 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:20:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:14,950 INFO L93 Difference]: Finished difference Result 2973 states and 11756 transitions. [2020-02-10 20:20:14,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:14,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:14,957 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:20:14,957 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 20:20:14,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 20:20:15,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1569. [2020-02-10 20:20:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:20:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7023 transitions. [2020-02-10 20:20:15,020 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7023 transitions. Word has length 28 [2020-02-10 20:20:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:15,020 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7023 transitions. [2020-02-10 20:20:15,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7023 transitions. [2020-02-10 20:20:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:15,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:15,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, 1, 1, 1] [2020-02-10 20:20:15,023 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:15,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:15,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2130397626, now seen corresponding path program 583 times [2020-02-10 20:20:15,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:15,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871321681] [2020-02-10 20:20:15,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:15,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871321681] [2020-02-10 20:20:15,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:15,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:15,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880366059] [2020-02-10 20:20:15,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:15,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:15,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:15,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:15,571 INFO L87 Difference]: Start difference. First operand 1569 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:20:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:15,717 INFO L93 Difference]: Finished difference Result 3004 states and 11839 transitions. [2020-02-10 20:20:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:15,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:15,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:15,724 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 20:20:15,724 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 20:20:15,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 20:20:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1589. [2020-02-10 20:20:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 20:20:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7073 transitions. [2020-02-10 20:20:15,788 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7073 transitions. Word has length 28 [2020-02-10 20:20:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:15,788 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7073 transitions. [2020-02-10 20:20:15,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7073 transitions. [2020-02-10 20:20:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:15,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:15,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:15,790 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1385695128, now seen corresponding path program 584 times [2020-02-10 20:20:15,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:15,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486650128] [2020-02-10 20:20:15,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:16,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486650128] [2020-02-10 20:20:16,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:16,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:16,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674066196] [2020-02-10 20:20:16,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:16,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:16,330 INFO L87 Difference]: Start difference. First operand 1589 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:20:16,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:16,535 INFO L93 Difference]: Finished difference Result 3002 states and 11827 transitions. [2020-02-10 20:20:16,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:16,535 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:16,542 INFO L225 Difference]: With dead ends: 3002 [2020-02-10 20:20:16,542 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:20:16,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:20:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1579. [2020-02-10 20:20:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:20:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7047 transitions. [2020-02-10 20:20:16,606 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7047 transitions. Word has length 28 [2020-02-10 20:20:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:16,606 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7047 transitions. [2020-02-10 20:20:16,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7047 transitions. [2020-02-10 20:20:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:16,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:16,608 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:16,609 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:16,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1629339868, now seen corresponding path program 585 times [2020-02-10 20:20:16,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:16,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317201242] [2020-02-10 20:20:16,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:17,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317201242] [2020-02-10 20:20:17,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:17,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:17,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181090374] [2020-02-10 20:20:17,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:17,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:17,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:17,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:17,159 INFO L87 Difference]: Start difference. First operand 1579 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:20:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:17,296 INFO L93 Difference]: Finished difference Result 3001 states and 11824 transitions. [2020-02-10 20:20:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:17,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:17,304 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:20:17,304 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:20:17,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:20:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1587. [2020-02-10 20:20:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:20:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7061 transitions. [2020-02-10 20:20:17,368 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7061 transitions. Word has length 28 [2020-02-10 20:20:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:17,368 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7061 transitions. [2020-02-10 20:20:17,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7061 transitions. [2020-02-10 20:20:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:17,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:17,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:17,370 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1802587560, now seen corresponding path program 586 times [2020-02-10 20:20:17,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:17,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262019300] [2020-02-10 20:20:17,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:17,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262019300] [2020-02-10 20:20:17,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:17,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:17,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207903814] [2020-02-10 20:20:17,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:17,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:17,952 INFO L87 Difference]: Start difference. First operand 1587 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:20:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:18,124 INFO L93 Difference]: Finished difference Result 2998 states and 11811 transitions. [2020-02-10 20:20:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:18,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:18,132 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:20:18,132 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 20:20:18,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 20:20:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1579. [2020-02-10 20:20:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:20:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7039 transitions. [2020-02-10 20:20:18,196 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7039 transitions. Word has length 28 [2020-02-10 20:20:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:18,196 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7039 transitions. [2020-02-10 20:20:18,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7039 transitions. [2020-02-10 20:20:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:18,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:18,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:18,198 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash -309983972, now seen corresponding path program 587 times [2020-02-10 20:20:18,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:18,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769165073] [2020-02-10 20:20:18,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:18,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769165073] [2020-02-10 20:20:18,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:18,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:18,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492181977] [2020-02-10 20:20:18,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:18,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:18,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:18,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:18,748 INFO L87 Difference]: Start difference. First operand 1579 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:20:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:18,974 INFO L93 Difference]: Finished difference Result 2996 states and 11808 transitions. [2020-02-10 20:20:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:18,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:18,982 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:20:18,982 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:20:18,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:20:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1586. [2020-02-10 20:20:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:20:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7052 transitions. [2020-02-10 20:20:19,046 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7052 transitions. Word has length 28 [2020-02-10 20:20:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:19,046 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7052 transitions. [2020-02-10 20:20:19,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7052 transitions. [2020-02-10 20:20:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:19,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:19,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:19,049 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash -881438778, now seen corresponding path program 588 times [2020-02-10 20:20:19,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:19,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866945915] [2020-02-10 20:20:19,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:19,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866945915] [2020-02-10 20:20:19,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:19,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:19,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105599864] [2020-02-10 20:20:19,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:19,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:19,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:19,591 INFO L87 Difference]: Start difference. First operand 1586 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:20:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:19,771 INFO L93 Difference]: Finished difference Result 2995 states and 11799 transitions. [2020-02-10 20:20:19,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:19,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:19,779 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:20:19,780 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:20:19,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:20:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1569. [2020-02-10 20:20:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:20:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7016 transitions. [2020-02-10 20:20:19,843 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7016 transitions. Word has length 28 [2020-02-10 20:20:19,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:19,843 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7016 transitions. [2020-02-10 20:20:19,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7016 transitions. [2020-02-10 20:20:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:19,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:19,845 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:19,845 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2098888314, now seen corresponding path program 589 times [2020-02-10 20:20:19,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:19,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504802544] [2020-02-10 20:20:19,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:20,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504802544] [2020-02-10 20:20:20,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:20,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:20,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700213718] [2020-02-10 20:20:20,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:20,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:20,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:20,376 INFO L87 Difference]: Start difference. First operand 1569 states and 7016 transitions. Second operand 11 states. [2020-02-10 20:20:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:20,516 INFO L93 Difference]: Finished difference Result 2978 states and 11766 transitions. [2020-02-10 20:20:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:20,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:20,522 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:20:20,523 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:20:20,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:20:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1579. [2020-02-10 20:20:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:20:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7042 transitions. [2020-02-10 20:20:20,586 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7042 transitions. Word has length 28 [2020-02-10 20:20:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:20,586 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7042 transitions. [2020-02-10 20:20:20,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7042 transitions. [2020-02-10 20:20:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:20,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:20,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:20,589 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:20,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:20,589 INFO L82 PathProgramCache]: Analyzing trace with hash 879921678, now seen corresponding path program 590 times [2020-02-10 20:20:20,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:20,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706661449] [2020-02-10 20:20:20,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:21,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706661449] [2020-02-10 20:20:21,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:21,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:21,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944975612] [2020-02-10 20:20:21,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:21,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:21,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:21,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:21,108 INFO L87 Difference]: Start difference. First operand 1579 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:20:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:21,283 INFO L93 Difference]: Finished difference Result 2972 states and 11750 transitions. [2020-02-10 20:20:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:21,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:21,290 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:20:21,290 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:20:21,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:20:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1574. [2020-02-10 20:20:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:20:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7029 transitions. [2020-02-10 20:20:21,370 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7029 transitions. Word has length 28 [2020-02-10 20:20:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:21,371 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7029 transitions. [2020-02-10 20:20:21,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7029 transitions. [2020-02-10 20:20:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:21,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:21,373 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:21,373 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1122993602, now seen corresponding path program 591 times [2020-02-10 20:20:21,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:21,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852280522] [2020-02-10 20:20:21,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:21,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852280522] [2020-02-10 20:20:21,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:21,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:21,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964063726] [2020-02-10 20:20:21,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:21,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:21,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:21,920 INFO L87 Difference]: Start difference. First operand 1574 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:20:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:22,094 INFO L93 Difference]: Finished difference Result 2984 states and 11776 transitions. [2020-02-10 20:20:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:22,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:22,103 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:20:22,103 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:20:22,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:20:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1582. [2020-02-10 20:20:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:20:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7043 transitions. [2020-02-10 20:20:22,174 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7043 transitions. Word has length 28 [2020-02-10 20:20:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:22,174 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7043 transitions. [2020-02-10 20:20:22,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7043 transitions. [2020-02-10 20:20:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:22,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:22,177 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:22,177 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1296241294, now seen corresponding path program 592 times [2020-02-10 20:20:22,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:22,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838280874] [2020-02-10 20:20:22,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:22,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838280874] [2020-02-10 20:20:22,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:22,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:22,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265670757] [2020-02-10 20:20:22,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:22,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:22,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:22,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:22,715 INFO L87 Difference]: Start difference. First operand 1582 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:20:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:22,906 INFO L93 Difference]: Finished difference Result 2981 states and 11763 transitions. [2020-02-10 20:20:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:22,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:22,914 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:20:22,914 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:20:22,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:20:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1574. [2020-02-10 20:20:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:20:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7024 transitions. [2020-02-10 20:20:22,977 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7024 transitions. Word has length 28 [2020-02-10 20:20:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:22,977 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7024 transitions. [2020-02-10 20:20:22,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7024 transitions. [2020-02-10 20:20:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:22,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:22,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:22,980 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1955632834, now seen corresponding path program 593 times [2020-02-10 20:20:22,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:22,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710371445] [2020-02-10 20:20:22,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:23,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710371445] [2020-02-10 20:20:23,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:23,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:23,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171657487] [2020-02-10 20:20:23,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:23,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:23,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:23,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:23,538 INFO L87 Difference]: Start difference. First operand 1574 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:20:23,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:23,791 INFO L93 Difference]: Finished difference Result 2968 states and 11738 transitions. [2020-02-10 20:20:23,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:23,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:23,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:23,798 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:20:23,799 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:20:23,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:20:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1578. [2020-02-10 20:20:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:20:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7031 transitions. [2020-02-10 20:20:23,861 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7031 transitions. Word has length 28 [2020-02-10 20:20:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:23,862 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7031 transitions. [2020-02-10 20:20:23,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7031 transitions. [2020-02-10 20:20:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:23,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20: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, 1, 1, 1] [2020-02-10 20:20:23,864 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:23,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:23,864 INFO L82 PathProgramCache]: Analyzing trace with hash -849929466, now seen corresponding path program 594 times [2020-02-10 20:20:23,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:23,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402253178] [2020-02-10 20:20:23,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:24,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402253178] [2020-02-10 20:20:24,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:24,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:24,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103289786] [2020-02-10 20:20:24,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:24,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:24,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:24,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:24,368 INFO L87 Difference]: Start difference. First operand 1578 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:20:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:24,566 INFO L93 Difference]: Finished difference Result 2971 states and 11740 transitions. [2020-02-10 20:20:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:24,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:24,574 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 20:20:24,574 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:20:24,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:20:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1569. [2020-02-10 20:20:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:20:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7011 transitions. [2020-02-10 20:20:24,637 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7011 transitions. Word has length 28 [2020-02-10 20:20:24,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:24,637 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7011 transitions. [2020-02-10 20:20:24,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7011 transitions. [2020-02-10 20:20:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:24,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:24,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:24,640 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:24,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:24,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1343682712, now seen corresponding path program 595 times [2020-02-10 20:20:24,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:24,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524576057] [2020-02-10 20:20:24,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:25,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524576057] [2020-02-10 20:20:25,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:25,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:25,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003312739] [2020-02-10 20:20:25,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:25,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:25,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:25,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:25,154 INFO L87 Difference]: Start difference. First operand 1569 states and 7011 transitions. Second operand 11 states. [2020-02-10 20:20:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:25,371 INFO L93 Difference]: Finished difference Result 2968 states and 11743 transitions. [2020-02-10 20:20:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:25,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:25,379 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:20:25,379 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:20:25,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:20:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1577. [2020-02-10 20:20:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:20:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7033 transitions. [2020-02-10 20:20:25,443 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7033 transitions. Word has length 28 [2020-02-10 20:20:25,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:25,443 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7033 transitions. [2020-02-10 20:20:25,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7033 transitions. [2020-02-10 20:20:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:25,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:25,445 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:25,445 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:25,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:25,445 INFO L82 PathProgramCache]: Analyzing trace with hash 890424782, now seen corresponding path program 596 times [2020-02-10 20:20:25,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:25,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743421056] [2020-02-10 20:20:25,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:25,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743421056] [2020-02-10 20:20:25,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:25,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:25,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024598751] [2020-02-10 20:20:25,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:25,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:25,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:25,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:25,971 INFO L87 Difference]: Start difference. First operand 1577 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:20:26,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:26,169 INFO L93 Difference]: Finished difference Result 2964 states and 11731 transitions. [2020-02-10 20:20:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:26,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:26,177 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:20:26,177 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:20:26,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:20:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1573. [2020-02-10 20:20:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:20:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7022 transitions. [2020-02-10 20:20:26,240 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7022 transitions. Word has length 28 [2020-02-10 20:20:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:26,240 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7022 transitions. [2020-02-10 20:20:26,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7022 transitions. [2020-02-10 20:20:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:26,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:26,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:26,243 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:26,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:26,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1878199204, now seen corresponding path program 597 times [2020-02-10 20:20:26,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:26,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116580267] [2020-02-10 20:20:26,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:26,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116580267] [2020-02-10 20:20:26,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:26,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:26,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998459276] [2020-02-10 20:20:26,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:26,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:26,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:26,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:26,781 INFO L87 Difference]: Start difference. First operand 1573 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:20:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:26,979 INFO L93 Difference]: Finished difference Result 2974 states and 11754 transitions. [2020-02-10 20:20:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:26,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:26,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:26,987 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:20:26,987 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:20:26,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:20:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1580. [2020-02-10 20:20:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:20:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7035 transitions. [2020-02-10 20:20:27,051 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7035 transitions. Word has length 28 [2020-02-10 20:20:27,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:27,052 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7035 transitions. [2020-02-10 20:20:27,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7035 transitions. [2020-02-10 20:20:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:27,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:27,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:27,054 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:27,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:27,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1306744398, now seen corresponding path program 598 times [2020-02-10 20:20:27,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:27,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966864561] [2020-02-10 20:20:27,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:27,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966864561] [2020-02-10 20:20:27,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:27,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:27,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395655438] [2020-02-10 20:20:27,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:27,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:27,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:27,584 INFO L87 Difference]: Start difference. First operand 1580 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:20:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:27,783 INFO L93 Difference]: Finished difference Result 2973 states and 11745 transitions. [2020-02-10 20:20:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:27,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:27,790 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:20:27,791 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 20:20:27,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 20:20:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1573. [2020-02-10 20:20:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:20:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7018 transitions. [2020-02-10 20:20:27,854 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7018 transitions. Word has length 28 [2020-02-10 20:20:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:27,855 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7018 transitions. [2020-02-10 20:20:27,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7018 transitions. [2020-02-10 20:20:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:27,857 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:27,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:27,857 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:27,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:27,857 INFO L82 PathProgramCache]: Analyzing trace with hash 355194980, now seen corresponding path program 599 times [2020-02-10 20:20:27,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:27,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888601843] [2020-02-10 20:20:27,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:28,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888601843] [2020-02-10 20:20:28,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:28,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:28,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424661408] [2020-02-10 20:20:28,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:28,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:28,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:28,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:28,379 INFO L87 Difference]: Start difference. First operand 1573 states and 7018 transitions. Second operand 11 states. [2020-02-10 20:20:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:28,564 INFO L93 Difference]: Finished difference Result 2963 states and 11725 transitions. [2020-02-10 20:20:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:28,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:28,572 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:20:28,572 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 20:20:28,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 20:20:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1577. [2020-02-10 20:20:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:20:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7025 transitions. [2020-02-10 20:20:28,677 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7025 transitions. Word has length 28 [2020-02-10 20:20:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:28,677 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7025 transitions. [2020-02-10 20:20:28,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7025 transitions. [2020-02-10 20:20:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:28,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:28,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:28,680 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1844599976, now seen corresponding path program 600 times [2020-02-10 20:20:28,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:28,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763119860] [2020-02-10 20:20:28,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:29,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763119860] [2020-02-10 20:20:29,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:29,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:29,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101297583] [2020-02-10 20:20:29,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:29,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:29,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:29,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:29,205 INFO L87 Difference]: Start difference. First operand 1577 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:20:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:29,439 INFO L93 Difference]: Finished difference Result 2966 states and 11727 transitions. [2020-02-10 20:20:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:29,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:29,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:29,447 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:20:29,447 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:20:29,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:20:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1555. [2020-02-10 20:20:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 20:20:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6981 transitions. [2020-02-10 20:20:29,510 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6981 transitions. Word has length 28 [2020-02-10 20:20:29,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:29,510 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6981 transitions. [2020-02-10 20:20:29,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6981 transitions. [2020-02-10 20:20:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:29,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:29,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:29,512 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:29,512 INFO L82 PathProgramCache]: Analyzing trace with hash -208706742, now seen corresponding path program 601 times [2020-02-10 20:20:29,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:29,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898550705] [2020-02-10 20:20:29,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:30,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898550705] [2020-02-10 20:20:30,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:30,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:30,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302446797] [2020-02-10 20:20:30,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:30,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:30,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:30,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:30,041 INFO L87 Difference]: Start difference. First operand 1555 states and 6981 transitions. Second operand 11 states. [2020-02-10 20:20:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:30,221 INFO L93 Difference]: Finished difference Result 2994 states and 11845 transitions. [2020-02-10 20:20:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:30,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:30,229 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 20:20:30,229 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:20:30,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:20:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1584. [2020-02-10 20:20:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:20:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7085 transitions. [2020-02-10 20:20:30,293 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7085 transitions. Word has length 28 [2020-02-10 20:20:30,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:30,293 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7085 transitions. [2020-02-10 20:20:30,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7085 transitions. [2020-02-10 20:20:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:30,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:30,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:30,296 INFO L427 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:30,296 INFO L82 PathProgramCache]: Analyzing trace with hash 535995756, now seen corresponding path program 602 times [2020-02-10 20:20:30,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:30,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205964324] [2020-02-10 20:20:30,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:30,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205964324] [2020-02-10 20:20:30,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:30,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:30,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38706190] [2020-02-10 20:20:30,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:30,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:30,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:30,835 INFO L87 Difference]: Start difference. First operand 1584 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:20:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:30,978 INFO L93 Difference]: Finished difference Result 2998 states and 11846 transitions. [2020-02-10 20:20:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:30,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:30,985 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:20:30,985 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:20:30,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:20:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1577. [2020-02-10 20:20:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:20:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7065 transitions. [2020-02-10 20:20:31,048 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7065 transitions. Word has length 28 [2020-02-10 20:20:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:31,048 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7065 transitions. [2020-02-10 20:20:31,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7065 transitions. [2020-02-10 20:20:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:31,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:31,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:31,051 INFO L427 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1402234216, now seen corresponding path program 603 times [2020-02-10 20:20:31,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:31,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901865057] [2020-02-10 20:20:31,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:31,570 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:20:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:31,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901865057] [2020-02-10 20:20:31,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:31,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:31,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446862119] [2020-02-10 20:20:31,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:31,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:31,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:31,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:31,578 INFO L87 Difference]: Start difference. First operand 1577 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:20:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:31,755 INFO L93 Difference]: Finished difference Result 2991 states and 11833 transitions. [2020-02-10 20:20:31,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:31,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:31,763 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:20:31,763 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:20:31,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:20:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1583. [2020-02-10 20:20:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:20:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7076 transitions. [2020-02-10 20:20:31,827 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7076 transitions. Word has length 28 [2020-02-10 20:20:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:31,827 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7076 transitions. [2020-02-10 20:20:31,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7076 transitions. [2020-02-10 20:20:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:31,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:31,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:31,829 INFO L427 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:31,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:31,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1403328084, now seen corresponding path program 604 times [2020-02-10 20:20:31,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:31,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352044720] [2020-02-10 20:20:31,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:32,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352044720] [2020-02-10 20:20:32,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:32,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:32,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322660941] [2020-02-10 20:20:32,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:32,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:32,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:32,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:32,341 INFO L87 Difference]: Start difference. First operand 1583 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:20:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:32,519 INFO L93 Difference]: Finished difference Result 2993 states and 11831 transitions. [2020-02-10 20:20:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:32,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:32,526 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:20:32,526 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:20:32,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:20:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1577. [2020-02-10 20:20:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:20:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7059 transitions. [2020-02-10 20:20:32,590 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7059 transitions. Word has length 28 [2020-02-10 20:20:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:32,590 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7059 transitions. [2020-02-10 20:20:32,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7059 transitions. [2020-02-10 20:20:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:32,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:32,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:32,593 INFO L427 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:32,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:32,593 INFO L82 PathProgramCache]: Analyzing trace with hash -537089624, now seen corresponding path program 605 times [2020-02-10 20:20:32,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:32,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825600327] [2020-02-10 20:20:32,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:33,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825600327] [2020-02-10 20:20:33,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:33,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:33,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241887211] [2020-02-10 20:20:33,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:33,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:33,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:33,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:33,146 INFO L87 Difference]: Start difference. First operand 1577 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:20:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:33,296 INFO L93 Difference]: Finished difference Result 3003 states and 11850 transitions. [2020-02-10 20:20:33,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:33,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:33,305 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:20:33,305 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:20:33,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:33,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:20:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1587. [2020-02-10 20:20:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:20:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7076 transitions. [2020-02-10 20:20:33,369 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7076 transitions. Word has length 28 [2020-02-10 20:20:33,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:33,370 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7076 transitions. [2020-02-10 20:20:33,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7076 transitions. [2020-02-10 20:20:33,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:33,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:33,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:33,372 INFO L427 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:33,372 INFO L82 PathProgramCache]: Analyzing trace with hash 207612874, now seen corresponding path program 606 times [2020-02-10 20:20:33,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:33,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876697707] [2020-02-10 20:20:33,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:33,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876697707] [2020-02-10 20:20:33,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:33,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:33,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218287264] [2020-02-10 20:20:33,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:33,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:33,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:33,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:33,907 INFO L87 Difference]: Start difference. First operand 1587 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:20:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:34,102 INFO L93 Difference]: Finished difference Result 3001 states and 11838 transitions. [2020-02-10 20:20:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:34,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:34,110 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:20:34,110 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:20:34,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:20:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1569. [2020-02-10 20:20:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:20:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7038 transitions. [2020-02-10 20:20:34,213 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7038 transitions. Word has length 28 [2020-02-10 20:20:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:34,213 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7038 transitions. [2020-02-10 20:20:34,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7038 transitions. [2020-02-10 20:20:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:34,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:34,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:34,216 INFO L427 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:34,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash -715053008, now seen corresponding path program 607 times [2020-02-10 20:20:34,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:34,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245546992] [2020-02-10 20:20:34,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:34,744 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:20:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:34,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245546992] [2020-02-10 20:20:34,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:34,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:34,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059582059] [2020-02-10 20:20:34,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:34,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:34,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:34,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:34,752 INFO L87 Difference]: Start difference. First operand 1569 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:20:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:34,931 INFO L93 Difference]: Finished difference Result 2980 states and 11802 transitions. [2020-02-10 20:20:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:34,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:34,939 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:20:34,939 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:20:34,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:20:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1581. [2020-02-10 20:20:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:20:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7069 transitions. [2020-02-10 20:20:35,002 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7069 transitions. Word has length 28 [2020-02-10 20:20:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:35,003 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7069 transitions. [2020-02-10 20:20:35,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:35,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7069 transitions. [2020-02-10 20:20:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:35,005 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20: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, 1, 1, 1] [2020-02-10 20:20:35,005 INFO L427 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:35,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:35,005 INFO L82 PathProgramCache]: Analyzing trace with hash 29649490, now seen corresponding path program 608 times [2020-02-10 20:20:35,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:35,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604667074] [2020-02-10 20:20:35,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:35,531 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:20:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:35,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604667074] [2020-02-10 20:20:35,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:35,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:35,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534993812] [2020-02-10 20:20:35,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:35,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:35,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:35,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:35,538 INFO L87 Difference]: Start difference. First operand 1581 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:20:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:35,675 INFO L93 Difference]: Finished difference Result 2984 states and 11803 transitions. [2020-02-10 20:20:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:35,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:35,682 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:20:35,682 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:20:35,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:20:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1574. [2020-02-10 20:20:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:20:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7051 transitions. [2020-02-10 20:20:35,746 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7051 transitions. Word has length 28 [2020-02-10 20:20:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:35,746 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7051 transitions. [2020-02-10 20:20:35,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7051 transitions. [2020-02-10 20:20:35,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:35,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:35,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:35,748 INFO L427 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1433743528, now seen corresponding path program 609 times [2020-02-10 20:20:35,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:35,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911417086] [2020-02-10 20:20:35,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:36,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-02-10 20:20:36,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911417086] [2020-02-10 20:20:36,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:36,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:36,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011907563] [2020-02-10 20:20:36,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:36,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:36,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:36,270 INFO L87 Difference]: Start difference. First operand 1574 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:20:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:36,438 INFO L93 Difference]: Finished difference Result 2971 states and 11778 transitions. [2020-02-10 20:20:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:36,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:36,446 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 20:20:36,446 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 20:20:36,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 20:20:36,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1578. [2020-02-10 20:20:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:20:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7058 transitions. [2020-02-10 20:20:36,509 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7058 transitions. Word has length 28 [2020-02-10 20:20:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:36,510 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7058 transitions. [2020-02-10 20:20:36,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7058 transitions. [2020-02-10 20:20:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:36,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:36,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:36,512 INFO L427 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash 862288722, now seen corresponding path program 610 times [2020-02-10 20:20:36,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:36,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946345599] [2020-02-10 20:20:36,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:37,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946345599] [2020-02-10 20:20:37,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:37,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:37,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932756149] [2020-02-10 20:20:37,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:37,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:37,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:37,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:37,033 INFO L87 Difference]: Start difference. First operand 1578 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:20:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:37,222 INFO L93 Difference]: Finished difference Result 2969 states and 11770 transitions. [2020-02-10 20:20:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:37,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:37,230 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:20:37,230 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:20:37,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:20:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1574. [2020-02-10 20:20:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:20:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7047 transitions. [2020-02-10 20:20:37,294 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7047 transitions. Word has length 28 [2020-02-10 20:20:37,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:37,294 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7047 transitions. [2020-02-10 20:20:37,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7047 transitions. [2020-02-10 20:20:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:37,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:37,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:37,296 INFO L427 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:37,296 INFO L82 PathProgramCache]: Analyzing trace with hash -505580312, now seen corresponding path program 611 times [2020-02-10 20:20:37,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:37,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886520290] [2020-02-10 20:20:37,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:37,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886520290] [2020-02-10 20:20:37,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:37,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:37,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188559663] [2020-02-10 20:20:37,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:37,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:37,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:37,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:37,823 INFO L87 Difference]: Start difference. First operand 1574 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:20:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:37,962 INFO L93 Difference]: Finished difference Result 2980 states and 11790 transitions. [2020-02-10 20:20:37,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:37,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:37,969 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:20:37,969 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:20:37,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:20:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1579. [2020-02-10 20:20:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:20:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7055 transitions. [2020-02-10 20:20:38,033 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7055 transitions. Word has length 28 [2020-02-10 20:20:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:38,034 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7055 transitions. [2020-02-10 20:20:38,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7055 transitions. [2020-02-10 20:20:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:38,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:38,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, 1, 1, 1] [2020-02-10 20:20:38,036 INFO L427 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:38,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1821737616, now seen corresponding path program 612 times [2020-02-10 20:20:38,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:38,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029039759] [2020-02-10 20:20:38,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:38,547 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:20:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:38,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029039759] [2020-02-10 20:20:38,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:38,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:38,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596914215] [2020-02-10 20:20:38,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:38,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:38,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:38,554 INFO L87 Difference]: Start difference. First operand 1579 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:20:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:38,733 INFO L93 Difference]: Finished difference Result 2974 states and 11774 transitions. [2020-02-10 20:20:38,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:38,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:38,740 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:20:38,740 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:20:38,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:20:38,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1569. [2020-02-10 20:20:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:20:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7033 transitions. [2020-02-10 20:20:38,803 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7033 transitions. Word has length 28 [2020-02-10 20:20:38,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:38,804 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7033 transitions. [2020-02-10 20:20:38,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7033 transitions. [2020-02-10 20:20:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:38,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:38,806 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:38,806 INFO L427 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:38,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:38,806 INFO L82 PathProgramCache]: Analyzing trace with hash -704549904, now seen corresponding path program 613 times [2020-02-10 20:20:38,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:38,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388077924] [2020-02-10 20:20:38,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:39,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388077924] [2020-02-10 20:20:39,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:39,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:39,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297291167] [2020-02-10 20:20:39,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:39,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:39,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:39,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:39,317 INFO L87 Difference]: Start difference. First operand 1569 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:20:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:39,490 INFO L93 Difference]: Finished difference Result 2972 states and 11782 transitions. [2020-02-10 20:20:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:39,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:39,497 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:20:39,497 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:20:39,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:39,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:20:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1579. [2020-02-10 20:20:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:20:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7059 transitions. [2020-02-10 20:20:39,561 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7059 transitions. Word has length 28 [2020-02-10 20:20:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:39,561 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7059 transitions. [2020-02-10 20:20:39,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7059 transitions. [2020-02-10 20:20:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:39,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:39,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:39,564 INFO L427 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash 784855092, now seen corresponding path program 614 times [2020-02-10 20:20:39,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:39,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570666248] [2020-02-10 20:20:39,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:40,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570666248] [2020-02-10 20:20:40,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:40,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:40,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610301795] [2020-02-10 20:20:40,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:40,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:40,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:40,106 INFO L87 Difference]: Start difference. First operand 1579 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:20:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:40,276 INFO L93 Difference]: Finished difference Result 2974 states and 11780 transitions. [2020-02-10 20:20:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:40,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:40,284 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:20:40,284 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:20:40,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:20:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1573. [2020-02-10 20:20:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:20:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 20:20:40,348 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 20:20:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:40,348 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 20:20:40,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 20:20:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:40,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:40,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:40,350 INFO L427 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash -166694326, now seen corresponding path program 615 times [2020-02-10 20:20:40,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:40,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231576127] [2020-02-10 20:20:40,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:40,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231576127] [2020-02-10 20:20:40,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:40,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:40,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346393240] [2020-02-10 20:20:40,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:40,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:40,902 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:20:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:41,100 INFO L93 Difference]: Finished difference Result 2966 states and 11764 transitions. [2020-02-10 20:20:41,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:41,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:41,107 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:20:41,108 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:20:41,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:20:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1577. [2020-02-10 20:20:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:20:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7051 transitions. [2020-02-10 20:20:41,171 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7051 transitions. Word has length 28 [2020-02-10 20:20:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:41,171 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7051 transitions. [2020-02-10 20:20:41,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7051 transitions. [2020-02-10 20:20:41,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:41,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:41,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:41,174 INFO L427 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:41,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:41,174 INFO L82 PathProgramCache]: Analyzing trace with hash -738149132, now seen corresponding path program 616 times [2020-02-10 20:20:41,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:41,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038844547] [2020-02-10 20:20:41,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:41,683 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:20:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:41,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038844547] [2020-02-10 20:20:41,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:41,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:41,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308474921] [2020-02-10 20:20:41,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:41,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:41,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:41,692 INFO L87 Difference]: Start difference. First operand 1577 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:20:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:41,912 INFO L93 Difference]: Finished difference Result 2964 states and 11756 transitions. [2020-02-10 20:20:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:41,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:41,919 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:20:41,919 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:20:41,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:20:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1573. [2020-02-10 20:20:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:20:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7040 transitions. [2020-02-10 20:20:41,983 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7040 transitions. Word has length 28 [2020-02-10 20:20:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:41,983 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7040 transitions. [2020-02-10 20:20:41,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7040 transitions. [2020-02-10 20:20:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:41,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:41,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:41,985 INFO L427 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:41,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:41,985 INFO L82 PathProgramCache]: Analyzing trace with hash 249625290, now seen corresponding path program 617 times [2020-02-10 20:20:41,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:41,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557661975] [2020-02-10 20:20:41,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:42,501 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:20:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:42,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557661975] [2020-02-10 20:20:42,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:42,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:42,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951716153] [2020-02-10 20:20:42,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:42,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:42,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:42,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:42,508 INFO L87 Difference]: Start difference. First operand 1573 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:20:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:42,703 INFO L93 Difference]: Finished difference Result 2970 states and 11768 transitions. [2020-02-10 20:20:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:42,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:42,711 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:20:42,711 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:20:42,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:20:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1577. [2020-02-10 20:20:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:20:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7047 transitions. [2020-02-10 20:20:42,775 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7047 transitions. Word has length 28 [2020-02-10 20:20:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:42,775 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7047 transitions. [2020-02-10 20:20:42,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7047 transitions. [2020-02-10 20:20:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:42,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:42,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, 1, 1, 1] [2020-02-10 20:20:42,777 INFO L427 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:42,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1811234512, now seen corresponding path program 618 times [2020-02-10 20:20:42,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:42,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203726264] [2020-02-10 20:20:42,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:43,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203726264] [2020-02-10 20:20:43,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:43,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:43,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880295775] [2020-02-10 20:20:43,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:43,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:43,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:43,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:43,305 INFO L87 Difference]: Start difference. First operand 1577 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:20:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:43,494 INFO L93 Difference]: Finished difference Result 2966 states and 11756 transitions. [2020-02-10 20:20:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:43,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:43,502 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:20:43,502 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:20:43,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:20:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1569. [2020-02-10 20:20:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:20:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7029 transitions. [2020-02-10 20:20:43,566 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7029 transitions. Word has length 28 [2020-02-10 20:20:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:43,566 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7029 transitions. [2020-02-10 20:20:43,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7029 transitions. [2020-02-10 20:20:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:43,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:43,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:43,568 INFO L427 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:43,569 INFO L82 PathProgramCache]: Analyzing trace with hash 50655698, now seen corresponding path program 619 times [2020-02-10 20:20:43,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:43,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728262221] [2020-02-10 20:20:43,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:44,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728262221] [2020-02-10 20:20:44,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:44,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:44,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608560247] [2020-02-10 20:20:44,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:44,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:44,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:44,126 INFO L87 Difference]: Start difference. First operand 1569 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:20:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:44,285 INFO L93 Difference]: Finished difference Result 2995 states and 11824 transitions. [2020-02-10 20:20:44,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:44,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:44,294 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:20:44,294 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:20:44,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:20:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1585. [2020-02-10 20:20:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:20:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7066 transitions. [2020-02-10 20:20:44,363 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7066 transitions. Word has length 28 [2020-02-10 20:20:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:44,363 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7066 transitions. [2020-02-10 20:20:44,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7066 transitions. [2020-02-10 20:20:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:44,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:44,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:44,366 INFO L427 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:44,366 INFO L82 PathProgramCache]: Analyzing trace with hash 795358196, now seen corresponding path program 620 times [2020-02-10 20:20:44,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:44,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873631659] [2020-02-10 20:20:44,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:44,900 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:20:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:44,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873631659] [2020-02-10 20:20:44,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:44,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:44,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079835390] [2020-02-10 20:20:44,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:44,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:44,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:44,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:44,908 INFO L87 Difference]: Start difference. First operand 1585 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:20:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:45,106 INFO L93 Difference]: Finished difference Result 2993 states and 11812 transitions. [2020-02-10 20:20:45,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:45,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:45,113 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:20:45,113 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:20:45,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:20:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1575. [2020-02-10 20:20:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:20:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7043 transitions. [2020-02-10 20:20:45,178 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7043 transitions. Word has length 28 [2020-02-10 20:20:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:45,178 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7043 transitions. [2020-02-10 20:20:45,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7043 transitions. [2020-02-10 20:20:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:45,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:45,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:45,181 INFO L427 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash 588511276, now seen corresponding path program 621 times [2020-02-10 20:20:45,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:45,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331140290] [2020-02-10 20:20:45,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:45,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331140290] [2020-02-10 20:20:45,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:45,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:45,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224518912] [2020-02-10 20:20:45,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:45,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:45,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:45,730 INFO L87 Difference]: Start difference. First operand 1575 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:20:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:45,862 INFO L93 Difference]: Finished difference Result 2986 states and 11797 transitions. [2020-02-10 20:20:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:45,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:45,869 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:20:45,869 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:20:45,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:45,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:20:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1580. [2020-02-10 20:20:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:20:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7051 transitions. [2020-02-10 20:20:45,933 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7051 transitions. Word has length 28 [2020-02-10 20:20:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:45,933 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7051 transitions. [2020-02-10 20:20:45,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7051 transitions. [2020-02-10 20:20:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:45,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:45,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, 1, 1, 1] [2020-02-10 20:20:45,935 INFO L427 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:45,935 INFO L82 PathProgramCache]: Analyzing trace with hash -727646028, now seen corresponding path program 622 times [2020-02-10 20:20:45,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:45,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25406137] [2020-02-10 20:20:45,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:46,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-02-10 20:20:46,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25406137] [2020-02-10 20:20:46,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:46,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:46,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488161671] [2020-02-10 20:20:46,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:46,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:46,454 INFO L87 Difference]: Start difference. First operand 1580 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:20:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:46,630 INFO L93 Difference]: Finished difference Result 2980 states and 11781 transitions. [2020-02-10 20:20:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:46,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:46,638 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:20:46,638 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:20:46,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:20:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 20:20:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:20:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7038 transitions. [2020-02-10 20:20:46,703 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7038 transitions. Word has length 28 [2020-02-10 20:20:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:46,703 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7038 transitions. [2020-02-10 20:20:46,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7038 transitions. [2020-02-10 20:20:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:46,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:46,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:46,706 INFO L427 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:46,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1350812564, now seen corresponding path program 623 times [2020-02-10 20:20:46,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:46,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376096001] [2020-02-10 20:20:46,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:47,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376096001] [2020-02-10 20:20:47,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:47,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:47,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136773857] [2020-02-10 20:20:47,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:47,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:47,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:47,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:47,235 INFO L87 Difference]: Start difference. First operand 1575 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:20:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:47,414 INFO L93 Difference]: Finished difference Result 2981 states and 11784 transitions. [2020-02-10 20:20:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:47,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:47,422 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:20:47,422 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:20:47,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:20:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1579. [2020-02-10 20:20:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:20:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7045 transitions. [2020-02-10 20:20:47,488 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7045 transitions. Word has length 28 [2020-02-10 20:20:47,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:47,488 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7045 transitions. [2020-02-10 20:20:47,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7045 transitions. [2020-02-10 20:20:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:47,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:47,490 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:47,490 INFO L427 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:47,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:47,491 INFO L82 PathProgramCache]: Analyzing trace with hash 883294930, now seen corresponding path program 624 times [2020-02-10 20:20:47,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:47,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212463930] [2020-02-10 20:20:47,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:48,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212463930] [2020-02-10 20:20:48,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:48,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:48,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019877855] [2020-02-10 20:20:48,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:48,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:48,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:48,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:48,023 INFO L87 Difference]: Start difference. First operand 1579 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:20:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:48,257 INFO L93 Difference]: Finished difference Result 2977 states and 11772 transitions. [2020-02-10 20:20:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:48,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:48,265 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:20:48,265 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:20:48,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:20:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1563. [2020-02-10 20:20:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:20:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7012 transitions. [2020-02-10 20:20:48,328 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7012 transitions. Word has length 28 [2020-02-10 20:20:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:48,328 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7012 transitions. [2020-02-10 20:20:48,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7012 transitions. [2020-02-10 20:20:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:48,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:48,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:48,330 INFO L427 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash -651605882, now seen corresponding path program 625 times [2020-02-10 20:20:48,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:48,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74264541] [2020-02-10 20:20:48,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:48,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74264541] [2020-02-10 20:20:48,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:48,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:48,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21129071] [2020-02-10 20:20:48,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:48,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:48,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:48,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:48,866 INFO L87 Difference]: Start difference. First operand 1563 states and 7012 transitions. Second operand 11 states. [2020-02-10 20:20:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:49,069 INFO L93 Difference]: Finished difference Result 3017 states and 11911 transitions. [2020-02-10 20:20:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:49,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:49,076 INFO L225 Difference]: With dead ends: 3017 [2020-02-10 20:20:49,077 INFO L226 Difference]: Without dead ends: 3001 [2020-02-10 20:20:49,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2020-02-10 20:20:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 1588. [2020-02-10 20:20:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:20:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7092 transitions. [2020-02-10 20:20:49,141 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7092 transitions. Word has length 28 [2020-02-10 20:20:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:49,141 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7092 transitions. [2020-02-10 20:20:49,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7092 transitions. [2020-02-10 20:20:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:49,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:49,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:49,143 INFO L427 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash 93096616, now seen corresponding path program 626 times [2020-02-10 20:20:49,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:49,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299786566] [2020-02-10 20:20:49,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:49,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299786566] [2020-02-10 20:20:49,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:49,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:49,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918414545] [2020-02-10 20:20:49,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:49,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:49,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:49,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:49,702 INFO L87 Difference]: Start difference. First operand 1588 states and 7092 transitions. Second operand 11 states. [2020-02-10 20:20:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:49,879 INFO L93 Difference]: Finished difference Result 3021 states and 11912 transitions. [2020-02-10 20:20:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:49,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:49,886 INFO L225 Difference]: With dead ends: 3021 [2020-02-10 20:20:49,887 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 20:20:49,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 20:20:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1581. [2020-02-10 20:20:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:20:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7072 transitions. [2020-02-10 20:20:49,954 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7072 transitions. Word has length 28 [2020-02-10 20:20:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:49,954 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7072 transitions. [2020-02-10 20:20:49,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7072 transitions. [2020-02-10 20:20:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:49,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:49,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:49,956 INFO L427 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:49,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:49,957 INFO L82 PathProgramCache]: Analyzing trace with hash 959335076, now seen corresponding path program 627 times [2020-02-10 20:20:49,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:49,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110912745] [2020-02-10 20:20:49,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:50,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110912745] [2020-02-10 20:20:50,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:50,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:50,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718597317] [2020-02-10 20:20:50,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:50,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:50,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:50,499 INFO L87 Difference]: Start difference. First operand 1581 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:20:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:50,708 INFO L93 Difference]: Finished difference Result 3014 states and 11899 transitions. [2020-02-10 20:20:50,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:50,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:50,716 INFO L225 Difference]: With dead ends: 3014 [2020-02-10 20:20:50,716 INFO L226 Difference]: Without dead ends: 2998 [2020-02-10 20:20:50,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2020-02-10 20:20:50,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 1587. [2020-02-10 20:20:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:20:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7083 transitions. [2020-02-10 20:20:50,781 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7083 transitions. Word has length 28 [2020-02-10 20:20:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:50,781 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7083 transitions. [2020-02-10 20:20:50,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7083 transitions. [2020-02-10 20:20:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:50,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:50,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:50,784 INFO L427 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1846227224, now seen corresponding path program 628 times [2020-02-10 20:20:50,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:50,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182042704] [2020-02-10 20:20:50,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:51,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182042704] [2020-02-10 20:20:51,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:51,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:51,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232143155] [2020-02-10 20:20:51,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:51,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:51,335 INFO L87 Difference]: Start difference. First operand 1587 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:20:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:51,561 INFO L93 Difference]: Finished difference Result 3016 states and 11897 transitions. [2020-02-10 20:20:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:51,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:51,569 INFO L225 Difference]: With dead ends: 3016 [2020-02-10 20:20:51,569 INFO L226 Difference]: Without dead ends: 2992 [2020-02-10 20:20:51,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-02-10 20:20:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1581. [2020-02-10 20:20:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:20:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7066 transitions. [2020-02-10 20:20:51,633 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7066 transitions. Word has length 28 [2020-02-10 20:20:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:51,633 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7066 transitions. [2020-02-10 20:20:51,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7066 transitions. [2020-02-10 20:20:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:51,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:51,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:51,635 INFO L427 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:51,636 INFO L82 PathProgramCache]: Analyzing trace with hash -979988764, now seen corresponding path program 629 times [2020-02-10 20:20:51,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:51,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930430591] [2020-02-10 20:20:51,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:52,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930430591] [2020-02-10 20:20:52,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:52,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:52,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293796240] [2020-02-10 20:20:52,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:52,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:52,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:52,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:52,186 INFO L87 Difference]: Start difference. First operand 1581 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:20:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:52,354 INFO L93 Difference]: Finished difference Result 3026 states and 11916 transitions. [2020-02-10 20:20:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:52,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:52,362 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 20:20:52,363 INFO L226 Difference]: Without dead ends: 3006 [2020-02-10 20:20:52,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2020-02-10 20:20:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 1591. [2020-02-10 20:20:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:20:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7083 transitions. [2020-02-10 20:20:52,428 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7083 transitions. Word has length 28 [2020-02-10 20:20:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:52,428 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7083 transitions. [2020-02-10 20:20:52,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7083 transitions. [2020-02-10 20:20:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:52,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:52,430 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:52,430 INFO L427 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:52,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:52,431 INFO L82 PathProgramCache]: Analyzing trace with hash -235286266, now seen corresponding path program 630 times [2020-02-10 20:20:52,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:52,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424563004] [2020-02-10 20:20:52,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:52,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424563004] [2020-02-10 20:20:52,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:52,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:52,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998584972] [2020-02-10 20:20:52,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:52,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:52,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:52,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:52,969 INFO L87 Difference]: Start difference. First operand 1591 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:20:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:53,157 INFO L93 Difference]: Finished difference Result 3024 states and 11904 transitions. [2020-02-10 20:20:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:53,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:53,165 INFO L225 Difference]: With dead ends: 3024 [2020-02-10 20:20:53,165 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 20:20:53,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 20:20:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1573. [2020-02-10 20:20:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:20:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7043 transitions. [2020-02-10 20:20:53,230 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7043 transitions. Word has length 28 [2020-02-10 20:20:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:53,230 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7043 transitions. [2020-02-10 20:20:53,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7043 transitions. [2020-02-10 20:20:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:53,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:53,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:53,233 INFO L427 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:53,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:53,233 INFO L82 PathProgramCache]: Analyzing trace with hash -63860560, now seen corresponding path program 631 times [2020-02-10 20:20:53,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:53,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567231511] [2020-02-10 20:20:53,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:53,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567231511] [2020-02-10 20:20:53,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:53,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:53,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202849015] [2020-02-10 20:20:53,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:53,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:53,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:53,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:53,769 INFO L87 Difference]: Start difference. First operand 1573 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:20:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:53,976 INFO L93 Difference]: Finished difference Result 3013 states and 11895 transitions. [2020-02-10 20:20:53,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:53,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:53,984 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 20:20:53,984 INFO L226 Difference]: Without dead ends: 2997 [2020-02-10 20:20:53,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2020-02-10 20:20:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1587. [2020-02-10 20:20:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:20:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7082 transitions. [2020-02-10 20:20:54,049 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7082 transitions. Word has length 28 [2020-02-10 20:20:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:54,050 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7082 transitions. [2020-02-10 20:20:54,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7082 transitions. [2020-02-10 20:20:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:54,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:54,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:54,052 INFO L427 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:54,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:54,052 INFO L82 PathProgramCache]: Analyzing trace with hash 680841938, now seen corresponding path program 632 times [2020-02-10 20:20:54,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:54,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000657289] [2020-02-10 20:20:54,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20: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-02-10 20:20:54,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000657289] [2020-02-10 20:20:54,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:54,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:54,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646679205] [2020-02-10 20:20:54,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:54,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:54,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:54,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:54,599 INFO L87 Difference]: Start difference. First operand 1587 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:20:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:54,744 INFO L93 Difference]: Finished difference Result 3017 states and 11896 transitions. [2020-02-10 20:20:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:54,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:54,752 INFO L225 Difference]: With dead ends: 3017 [2020-02-10 20:20:54,752 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 20:20:54,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 20:20:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1580. [2020-02-10 20:20:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:20:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7062 transitions. [2020-02-10 20:20:54,816 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7062 transitions. Word has length 28 [2020-02-10 20:20:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:54,816 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7062 transitions. [2020-02-10 20:20:54,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7062 transitions. [2020-02-10 20:20:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:54,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:54,818 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:54,818 INFO L427 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:54,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:54,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1011850596, now seen corresponding path program 633 times [2020-02-10 20:20:54,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:54,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215715073] [2020-02-10 20:20:54,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:55,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215715073] [2020-02-10 20:20:55,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:55,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:55,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862901882] [2020-02-10 20:20:55,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:55,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:55,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:55,364 INFO L87 Difference]: Start difference. First operand 1580 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:20:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:55,545 INFO L93 Difference]: Finished difference Result 3009 states and 11881 transitions. [2020-02-10 20:20:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:55,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:55,554 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:20:55,554 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 20:20:55,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 20:20:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1586. [2020-02-10 20:20:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:20:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7073 transitions. [2020-02-10 20:20:55,617 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7073 transitions. Word has length 28 [2020-02-10 20:20:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:55,617 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7073 transitions. [2020-02-10 20:20:55,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7073 transitions. [2020-02-10 20:20:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:55,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:55,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:55,620 INFO L427 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:55,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1929800786, now seen corresponding path program 634 times [2020-02-10 20:20:55,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:55,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018634919] [2020-02-10 20:20:55,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:56,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018634919] [2020-02-10 20:20:56,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:56,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:56,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701680642] [2020-02-10 20:20:56,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:56,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:56,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:56,165 INFO L87 Difference]: Start difference. First operand 1586 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:20:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:56,350 INFO L93 Difference]: Finished difference Result 3010 states and 11877 transitions. [2020-02-10 20:20:56,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:56,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:56,357 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 20:20:56,357 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 20:20:56,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 20:20:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1580. [2020-02-10 20:20:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:20:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7056 transitions. [2020-02-10 20:20:56,422 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7056 transitions. Word has length 28 [2020-02-10 20:20:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:56,422 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7056 transitions. [2020-02-10 20:20:56,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7056 transitions. [2020-02-10 20:20:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:56,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:56,424 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:56,424 INFO L427 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:56,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:56,425 INFO L82 PathProgramCache]: Analyzing trace with hash -927473244, now seen corresponding path program 635 times [2020-02-10 20:20:56,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:56,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248052648] [2020-02-10 20:20:56,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:56,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248052648] [2020-02-10 20:20:56,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:56,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:56,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541217430] [2020-02-10 20:20:56,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:56,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:56,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:56,983 INFO L87 Difference]: Start difference. First operand 1580 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:20:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:57,167 INFO L93 Difference]: Finished difference Result 3019 states and 11894 transitions. [2020-02-10 20:20:57,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:57,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:57,175 INFO L225 Difference]: With dead ends: 3019 [2020-02-10 20:20:57,175 INFO L226 Difference]: Without dead ends: 2999 [2020-02-10 20:20:57,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2020-02-10 20:20:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1588. [2020-02-10 20:20:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:20:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7070 transitions. [2020-02-10 20:20:57,239 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7070 transitions. Word has length 28 [2020-02-10 20:20:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:57,239 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7070 transitions. [2020-02-10 20:20:57,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7070 transitions. [2020-02-10 20:20:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:57,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:57,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:57,242 INFO L427 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:57,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash -754225552, now seen corresponding path program 636 times [2020-02-10 20:20:57,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:57,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350963165] [2020-02-10 20:20:57,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:57,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350963165] [2020-02-10 20:20:57,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:57,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:57,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244409792] [2020-02-10 20:20:57,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:57,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:57,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:57,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:57,782 INFO L87 Difference]: Start difference. First operand 1588 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:20:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:58,036 INFO L93 Difference]: Finished difference Result 3016 states and 11881 transitions. [2020-02-10 20:20:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:58,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:58,044 INFO L225 Difference]: With dead ends: 3016 [2020-02-10 20:20:58,044 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 20:20:58,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 20:20:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1573. [2020-02-10 20:20:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:20:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7036 transitions. [2020-02-10 20:20:58,107 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7036 transitions. Word has length 28 [2020-02-10 20:20:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:58,107 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7036 transitions. [2020-02-10 20:20:58,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7036 transitions. [2020-02-10 20:20:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:58,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:58,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:58,110 INFO L427 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:58,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash -53357456, now seen corresponding path program 637 times [2020-02-10 20:20:58,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:58,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199336525] [2020-02-10 20:20:58,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:58,632 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:20:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:58,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199336525] [2020-02-10 20:20:58,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:58,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:58,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762011619] [2020-02-10 20:20:58,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:58,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:58,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:58,640 INFO L87 Difference]: Start difference. First operand 1573 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:20:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:58,903 INFO L93 Difference]: Finished difference Result 3005 states and 11873 transitions. [2020-02-10 20:20:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:58,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:58,911 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:20:58,911 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:20:58,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:58,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:20:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1585. [2020-02-10 20:20:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:20:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7070 transitions. [2020-02-10 20:20:58,974 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7070 transitions. Word has length 28 [2020-02-10 20:20:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:58,974 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7070 transitions. [2020-02-10 20:20:58,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7070 transitions. [2020-02-10 20:20:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:58,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:58,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:58,976 INFO L427 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1436047540, now seen corresponding path program 638 times [2020-02-10 20:20:58,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:58,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891717298] [2020-02-10 20:20:58,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:59,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891717298] [2020-02-10 20:20:59,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:59,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:20:59,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537594932] [2020-02-10 20:20:59,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:20:59,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:59,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:20:59,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:59,519 INFO L87 Difference]: Start difference. First operand 1585 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:20:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:59,725 INFO L93 Difference]: Finished difference Result 3007 states and 11871 transitions. [2020-02-10 20:20:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:20:59,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:20:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:59,733 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 20:20:59,733 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:20:59,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:20:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:20:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1579. [2020-02-10 20:20:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:20:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7053 transitions. [2020-02-10 20:20:59,796 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7053 transitions. Word has length 28 [2020-02-10 20:20:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:59,797 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7053 transitions. [2020-02-10 20:20:59,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:20:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7053 transitions. [2020-02-10 20:20:59,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:20:59,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:59,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, 1, 1, 1] [2020-02-10 20:20:59,799 INFO L427 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:59,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:59,799 INFO L82 PathProgramCache]: Analyzing trace with hash -588587258, now seen corresponding path program 639 times [2020-02-10 20:20:59,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:59,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542859952] [2020-02-10 20:20:59,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:00,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542859952] [2020-02-10 20:21:00,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:00,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:00,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253398910] [2020-02-10 20:21:00,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:00,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:00,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:00,342 INFO L87 Difference]: Start difference. First operand 1579 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:21:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:00,599 INFO L93 Difference]: Finished difference Result 3004 states and 11865 transitions. [2020-02-10 20:21:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:00,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:00,607 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 20:21:00,607 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 20:21:00,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 20:21:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1585. [2020-02-10 20:21:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:21:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7064 transitions. [2020-02-10 20:21:00,671 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7064 transitions. Word has length 28 [2020-02-10 20:21:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:00,671 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7064 transitions. [2020-02-10 20:21:00,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7064 transitions. [2020-02-10 20:21:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:00,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:00,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:00,674 INFO L427 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:00,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:00,674 INFO L82 PathProgramCache]: Analyzing trace with hash 329362932, now seen corresponding path program 640 times [2020-02-10 20:21:00,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:00,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94311615] [2020-02-10 20:21:00,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:01,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94311615] [2020-02-10 20:21:01,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:01,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:01,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722094619] [2020-02-10 20:21:01,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:01,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:01,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:01,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:01,208 INFO L87 Difference]: Start difference. First operand 1585 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:21:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:01,407 INFO L93 Difference]: Finished difference Result 3005 states and 11861 transitions. [2020-02-10 20:21:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:01,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:01,415 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:21:01,415 INFO L226 Difference]: Without dead ends: 2982 [2020-02-10 20:21:01,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2020-02-10 20:21:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1579. [2020-02-10 20:21:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:21:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7047 transitions. [2020-02-10 20:21:01,480 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7047 transitions. Word has length 28 [2020-02-10 20:21:01,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:01,480 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7047 transitions. [2020-02-10 20:21:01,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7047 transitions. [2020-02-10 20:21:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:01,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:01,483 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:01,483 INFO L427 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:01,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:01,483 INFO L82 PathProgramCache]: Analyzing trace with hash -172267642, now seen corresponding path program 641 times [2020-02-10 20:21:01,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:01,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373722804] [2020-02-10 20:21:01,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:02,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373722804] [2020-02-10 20:21:02,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:02,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:02,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259180418] [2020-02-10 20:21:02,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:02,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:02,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:02,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:02,031 INFO L87 Difference]: Start difference. First operand 1579 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:21:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:02,229 INFO L93 Difference]: Finished difference Result 3009 states and 11870 transitions. [2020-02-10 20:21:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:02,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:02,237 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:21:02,238 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:21:02,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:21:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1586. [2020-02-10 20:21:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:21:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7060 transitions. [2020-02-10 20:21:02,328 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7060 transitions. Word has length 28 [2020-02-10 20:21:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:02,328 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7060 transitions. [2020-02-10 20:21:02,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7060 transitions. [2020-02-10 20:21:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:02,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:02,331 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:02,331 INFO L427 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash -743722448, now seen corresponding path program 642 times [2020-02-10 20:21:02,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:02,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014825239] [2020-02-10 20:21:02,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:02,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014825239] [2020-02-10 20:21:02,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:02,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:02,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576403723] [2020-02-10 20:21:02,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:02,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:02,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:02,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:02,866 INFO L87 Difference]: Start difference. First operand 1586 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:21:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:03,068 INFO L93 Difference]: Finished difference Result 3008 states and 11861 transitions. [2020-02-10 20:21:03,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:03,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:03,075 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 20:21:03,076 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:21:03,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:21:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1573. [2020-02-10 20:21:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:21:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7030 transitions. [2020-02-10 20:21:03,140 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7030 transitions. Word has length 28 [2020-02-10 20:21:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:03,140 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7030 transitions. [2020-02-10 20:21:03,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7030 transitions. [2020-02-10 20:21:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:03,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:03,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:03,143 INFO L427 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash 701848146, now seen corresponding path program 643 times [2020-02-10 20:21:03,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:03,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348236432] [2020-02-10 20:21:03,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:03,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348236432] [2020-02-10 20:21:03,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:03,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:03,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888650019] [2020-02-10 20:21:03,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:03,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:03,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:03,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:03,704 INFO L87 Difference]: Start difference. First operand 1573 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:21:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:03,930 INFO L93 Difference]: Finished difference Result 3031 states and 11921 transitions. [2020-02-10 20:21:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:03,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:03,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:03,938 INFO L225 Difference]: With dead ends: 3031 [2020-02-10 20:21:03,938 INFO L226 Difference]: Without dead ends: 3011 [2020-02-10 20:21:03,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2020-02-10 20:21:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 1593. [2020-02-10 20:21:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 20:21:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7080 transitions. [2020-02-10 20:21:04,002 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7080 transitions. Word has length 28 [2020-02-10 20:21:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:04,002 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7080 transitions. [2020-02-10 20:21:04,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7080 transitions. [2020-02-10 20:21:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:04,005 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:04,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:04,005 INFO L427 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:04,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:04,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1446550644, now seen corresponding path program 644 times [2020-02-10 20:21:04,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:04,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101145960] [2020-02-10 20:21:04,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:04,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101145960] [2020-02-10 20:21:04,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:04,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:04,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464521271] [2020-02-10 20:21:04,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:04,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:04,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:04,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:04,557 INFO L87 Difference]: Start difference. First operand 1593 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:21:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:04,765 INFO L93 Difference]: Finished difference Result 3029 states and 11909 transitions. [2020-02-10 20:21:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:04,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:04,772 INFO L225 Difference]: With dead ends: 3029 [2020-02-10 20:21:04,772 INFO L226 Difference]: Without dead ends: 3001 [2020-02-10 20:21:04,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2020-02-10 20:21:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 1583. [2020-02-10 20:21:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:21:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7054 transitions. [2020-02-10 20:21:04,837 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7054 transitions. Word has length 28 [2020-02-10 20:21:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:04,837 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7054 transitions. [2020-02-10 20:21:04,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7054 transitions. [2020-02-10 20:21:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:04,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:04,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:04,840 INFO L427 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:04,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:04,840 INFO L82 PathProgramCache]: Analyzing trace with hash 166618344, now seen corresponding path program 645 times [2020-02-10 20:21:04,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:04,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579595271] [2020-02-10 20:21:04,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:05,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579595271] [2020-02-10 20:21:05,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:05,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:05,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686071638] [2020-02-10 20:21:05,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:05,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:05,391 INFO L87 Difference]: Start difference. First operand 1583 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:21:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:05,562 INFO L93 Difference]: Finished difference Result 3028 states and 11906 transitions. [2020-02-10 20:21:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:05,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:05,570 INFO L225 Difference]: With dead ends: 3028 [2020-02-10 20:21:05,570 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 20:21:05,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 20:21:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1591. [2020-02-10 20:21:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:21:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7068 transitions. [2020-02-10 20:21:05,636 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7068 transitions. Word has length 28 [2020-02-10 20:21:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:05,636 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7068 transitions. [2020-02-10 20:21:05,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7068 transitions. [2020-02-10 20:21:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:05,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:05,638 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:05,639 INFO L427 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:05,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:05,639 INFO L82 PathProgramCache]: Analyzing trace with hash 339866036, now seen corresponding path program 646 times [2020-02-10 20:21:05,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:05,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871677933] [2020-02-10 20:21:05,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:06,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871677933] [2020-02-10 20:21:06,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:06,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:06,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705316470] [2020-02-10 20:21:06,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:06,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:06,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:06,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:06,190 INFO L87 Difference]: Start difference. First operand 1591 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:21:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:06,389 INFO L93 Difference]: Finished difference Result 3025 states and 11893 transitions. [2020-02-10 20:21:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:06,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:06,396 INFO L225 Difference]: With dead ends: 3025 [2020-02-10 20:21:06,396 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 20:21:06,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 20:21:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1583. [2020-02-10 20:21:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:21:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7046 transitions. [2020-02-10 20:21:06,459 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7046 transitions. Word has length 28 [2020-02-10 20:21:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:06,459 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7046 transitions. [2020-02-10 20:21:06,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7046 transitions. [2020-02-10 20:21:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:06,462 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:06,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:06,462 INFO L427 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1772705496, now seen corresponding path program 647 times [2020-02-10 20:21:06,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:06,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724838128] [2020-02-10 20:21:06,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:07,014 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:21:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:07,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724838128] [2020-02-10 20:21:07,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:07,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:07,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500316778] [2020-02-10 20:21:07,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:07,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:07,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:07,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:07,022 INFO L87 Difference]: Start difference. First operand 1583 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:21:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:07,195 INFO L93 Difference]: Finished difference Result 3023 states and 11890 transitions. [2020-02-10 20:21:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:07,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:07,203 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 20:21:07,204 INFO L226 Difference]: Without dead ends: 3005 [2020-02-10 20:21:07,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2020-02-10 20:21:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1590. [2020-02-10 20:21:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:21:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7059 transitions. [2020-02-10 20:21:07,270 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7059 transitions. Word has length 28 [2020-02-10 20:21:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:07,270 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7059 transitions. [2020-02-10 20:21:07,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7059 transitions. [2020-02-10 20:21:07,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:07,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:07,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:07,273 INFO L427 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:07,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:07,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1950806994, now seen corresponding path program 648 times [2020-02-10 20:21:07,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:07,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139045866] [2020-02-10 20:21:07,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:07,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139045866] [2020-02-10 20:21:07,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:07,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:07,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139618938] [2020-02-10 20:21:07,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:07,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:07,820 INFO L87 Difference]: Start difference. First operand 1590 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:21:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:08,002 INFO L93 Difference]: Finished difference Result 3022 states and 11881 transitions. [2020-02-10 20:21:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:08,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:08,010 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 20:21:08,010 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:21:08,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:21:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1563. [2020-02-10 20:21:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:21:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7004 transitions. [2020-02-10 20:21:08,098 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7004 transitions. Word has length 28 [2020-02-10 20:21:08,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:08,098 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7004 transitions. [2020-02-10 20:21:08,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7004 transitions. [2020-02-10 20:21:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:08,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:08,101 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:08,101 INFO L427 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 325182790, now seen corresponding path program 649 times [2020-02-10 20:21:08,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:08,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625985640] [2020-02-10 20:21:08,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:08,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625985640] [2020-02-10 20:21:08,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:08,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:08,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843564063] [2020-02-10 20:21:08,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:08,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:08,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:08,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:08,607 INFO L87 Difference]: Start difference. First operand 1563 states and 7004 transitions. Second operand 11 states. [2020-02-10 20:21:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:08,780 INFO L93 Difference]: Finished difference Result 2974 states and 11781 transitions. [2020-02-10 20:21:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:08,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:08,788 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:21:08,788 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:21:08,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:21:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1580. [2020-02-10 20:21:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:21:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7058 transitions. [2020-02-10 20:21:08,851 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7058 transitions. Word has length 28 [2020-02-10 20:21:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:08,851 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7058 transitions. [2020-02-10 20:21:08,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7058 transitions. [2020-02-10 20:21:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:08,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:08,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:08,854 INFO L427 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:08,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1069885288, now seen corresponding path program 650 times [2020-02-10 20:21:08,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:08,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681366549] [2020-02-10 20:21:08,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:09,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681366549] [2020-02-10 20:21:09,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:09,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:09,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130549271] [2020-02-10 20:21:09,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:09,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:09,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:09,388 INFO L87 Difference]: Start difference. First operand 1580 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:21:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:09,521 INFO L93 Difference]: Finished difference Result 2978 states and 11782 transitions. [2020-02-10 20:21:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:09,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:09,528 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:21:09,528 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:21:09,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:21:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1573. [2020-02-10 20:21:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:21:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7040 transitions. [2020-02-10 20:21:09,593 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7040 transitions. Word has length 28 [2020-02-10 20:21:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:09,593 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7040 transitions. [2020-02-10 20:21:09,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7040 transitions. [2020-02-10 20:21:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:09,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:09,596 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:09,596 INFO L427 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1820987970, now seen corresponding path program 651 times [2020-02-10 20:21:09,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:09,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173654741] [2020-02-10 20:21:09,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:10,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173654741] [2020-02-10 20:21:10,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:10,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:10,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324870751] [2020-02-10 20:21:10,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:10,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:10,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:10,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:10,118 INFO L87 Difference]: Start difference. First operand 1573 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:21:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:10,305 INFO L93 Difference]: Finished difference Result 2965 states and 11757 transitions. [2020-02-10 20:21:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:10,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:10,312 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:21:10,312 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 20:21:10,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 20:21:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1577. [2020-02-10 20:21:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:21:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7047 transitions. [2020-02-10 20:21:10,375 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7047 transitions. Word has length 28 [2020-02-10 20:21:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:10,375 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7047 transitions. [2020-02-10 20:21:10,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7047 transitions. [2020-02-10 20:21:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:10,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:10,377 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:10,377 INFO L427 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:10,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:10,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1902524520, now seen corresponding path program 652 times [2020-02-10 20:21:10,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:10,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656567029] [2020-02-10 20:21:10,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:10,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656567029] [2020-02-10 20:21:10,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:10,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:10,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94179250] [2020-02-10 20:21:10,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:10,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:10,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:10,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:10,889 INFO L87 Difference]: Start difference. First operand 1577 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:21:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:11,060 INFO L93 Difference]: Finished difference Result 2963 states and 11749 transitions. [2020-02-10 20:21:11,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:11,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:11,068 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:21:11,068 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:21:11,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:21:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1573. [2020-02-10 20:21:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:21:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7036 transitions. [2020-02-10 20:21:11,135 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7036 transitions. Word has length 28 [2020-02-10 20:21:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:11,135 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7036 transitions. [2020-02-10 20:21:11,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7036 transitions. [2020-02-10 20:21:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:11,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:11,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:11,138 INFO L427 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:11,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:11,138 INFO L82 PathProgramCache]: Analyzing trace with hash 534655486, now seen corresponding path program 653 times [2020-02-10 20:21:11,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:11,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949879446] [2020-02-10 20:21:11,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:11,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949879446] [2020-02-10 20:21:11,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:11,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:11,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569745741] [2020-02-10 20:21:11,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:11,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:11,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:11,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:11,650 INFO L87 Difference]: Start difference. First operand 1573 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:21:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:11,781 INFO L93 Difference]: Finished difference Result 2974 states and 11769 transitions. [2020-02-10 20:21:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:11,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:11,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:11,789 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:21:11,789 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:21:11,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:21:11,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1578. [2020-02-10 20:21:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:21:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7044 transitions. [2020-02-10 20:21:11,854 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7044 transitions. Word has length 28 [2020-02-10 20:21:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:11,854 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7044 transitions. [2020-02-10 20:21:11,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7044 transitions. [2020-02-10 20:21:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:11,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:11,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:11,857 INFO L427 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:11,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:11,857 INFO L82 PathProgramCache]: Analyzing trace with hash -781501818, now seen corresponding path program 654 times [2020-02-10 20:21:11,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:11,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503648788] [2020-02-10 20:21:11,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:12,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503648788] [2020-02-10 20:21:12,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:12,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:12,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181852368] [2020-02-10 20:21:12,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:12,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:12,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:12,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:12,364 INFO L87 Difference]: Start difference. First operand 1578 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:21:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:12,535 INFO L93 Difference]: Finished difference Result 2968 states and 11753 transitions. [2020-02-10 20:21:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:12,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:12,543 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:21:12,543 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:21:12,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:21:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1568. [2020-02-10 20:21:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:21:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7022 transitions. [2020-02-10 20:21:12,608 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7022 transitions. Word has length 28 [2020-02-10 20:21:12,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:12,608 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7022 transitions. [2020-02-10 20:21:12,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7022 transitions. [2020-02-10 20:21:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:12,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:12,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, 1, 1, 1] [2020-02-10 20:21:12,611 INFO L427 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1419274378, now seen corresponding path program 655 times [2020-02-10 20:21:12,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:12,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69972034] [2020-02-10 20:21:12,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:13,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69972034] [2020-02-10 20:21:13,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:13,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:13,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596650603] [2020-02-10 20:21:13,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:13,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:13,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:13,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:13,135 INFO L87 Difference]: Start difference. First operand 1568 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:21:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:13,315 INFO L93 Difference]: Finished difference Result 2984 states and 11805 transitions. [2020-02-10 20:21:13,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:13,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:13,323 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:21:13,323 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:21:13,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:21:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1582. [2020-02-10 20:21:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:21:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7061 transitions. [2020-02-10 20:21:13,389 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7061 transitions. Word has length 28 [2020-02-10 20:21:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:13,389 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7061 transitions. [2020-02-10 20:21:13,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7061 transitions. [2020-02-10 20:21:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:13,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:13,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:13,392 INFO L427 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:13,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:13,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2130990420, now seen corresponding path program 656 times [2020-02-10 20:21:13,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:13,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265194510] [2020-02-10 20:21:13,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:13,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265194510] [2020-02-10 20:21:13,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:13,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:13,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121641082] [2020-02-10 20:21:13,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:13,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:13,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:13,946 INFO L87 Difference]: Start difference. First operand 1582 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:21:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:14,088 INFO L93 Difference]: Finished difference Result 2988 states and 11806 transitions. [2020-02-10 20:21:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:14,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:14,096 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:21:14,096 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:21:14,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:21:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 20:21:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:21:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7041 transitions. [2020-02-10 20:21:14,161 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7041 transitions. Word has length 28 [2020-02-10 20:21:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:14,161 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7041 transitions. [2020-02-10 20:21:14,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7041 transitions. [2020-02-10 20:21:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:14,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:14,163 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:14,163 INFO L427 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:14,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1799981762, now seen corresponding path program 657 times [2020-02-10 20:21:14,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:14,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759148833] [2020-02-10 20:21:14,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:14,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759148833] [2020-02-10 20:21:14,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:14,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:14,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983209471] [2020-02-10 20:21:14,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:14,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:14,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:14,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:14,696 INFO L87 Difference]: Start difference. First operand 1575 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:21:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:14,873 INFO L93 Difference]: Finished difference Result 2980 states and 11791 transitions. [2020-02-10 20:21:14,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:14,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:14,881 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:21:14,881 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:21:14,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:21:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1581. [2020-02-10 20:21:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:21:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7052 transitions. [2020-02-10 20:21:14,945 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7052 transitions. Word has length 28 [2020-02-10 20:21:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:14,946 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7052 transitions. [2020-02-10 20:21:14,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7052 transitions. [2020-02-10 20:21:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:14,948 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:14,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, 1, 1, 1] [2020-02-10 20:21:14,948 INFO L427 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:14,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:14,948 INFO L82 PathProgramCache]: Analyzing trace with hash -882031572, now seen corresponding path program 658 times [2020-02-10 20:21:14,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:14,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641135336] [2020-02-10 20:21:14,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:15,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641135336] [2020-02-10 20:21:15,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:15,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:15,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429375048] [2020-02-10 20:21:15,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:15,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:15,483 INFO L87 Difference]: Start difference. First operand 1581 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:21:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:15,664 INFO L93 Difference]: Finished difference Result 2981 states and 11787 transitions. [2020-02-10 20:21:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:15,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:15,672 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:21:15,672 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:21:15,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:21:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1575. [2020-02-10 20:21:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:21:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7035 transitions. [2020-02-10 20:21:15,738 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7035 transitions. Word has length 28 [2020-02-10 20:21:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:15,738 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7035 transitions. [2020-02-10 20:21:15,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7035 transitions. [2020-02-10 20:21:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:15,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:15,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:15,741 INFO L427 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:15,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:15,741 INFO L82 PathProgramCache]: Analyzing trace with hash 555661694, now seen corresponding path program 659 times [2020-02-10 20:21:15,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:15,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831912894] [2020-02-10 20:21:15,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:16,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831912894] [2020-02-10 20:21:16,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:16,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:16,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408411759] [2020-02-10 20:21:16,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:16,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:16,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:16,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:16,273 INFO L87 Difference]: Start difference. First operand 1575 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:21:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:16,411 INFO L93 Difference]: Finished difference Result 2990 states and 11804 transitions. [2020-02-10 20:21:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:16,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:16,418 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:21:16,418 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:21:16,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:21:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1583. [2020-02-10 20:21:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:21:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7049 transitions. [2020-02-10 20:21:16,482 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7049 transitions. Word has length 28 [2020-02-10 20:21:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:16,482 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7049 transitions. [2020-02-10 20:21:16,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7049 transitions. [2020-02-10 20:21:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:16,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:16,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:16,484 INFO L427 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash 728909386, now seen corresponding path program 660 times [2020-02-10 20:21:16,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:16,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315111688] [2020-02-10 20:21:16,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:17,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315111688] [2020-02-10 20:21:17,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:17,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:17,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291068752] [2020-02-10 20:21:17,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:17,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:17,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:17,011 INFO L87 Difference]: Start difference. First operand 1583 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:21:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:17,186 INFO L93 Difference]: Finished difference Result 2987 states and 11791 transitions. [2020-02-10 20:21:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:17,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:17,193 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 20:21:17,193 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 20:21:17,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 20:21:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1568. [2020-02-10 20:21:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:21:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7017 transitions. [2020-02-10 20:21:17,256 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7017 transitions. Word has length 28 [2020-02-10 20:21:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:17,256 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7017 transitions. [2020-02-10 20:21:17,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7017 transitions. [2020-02-10 20:21:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:17,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:17,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:17,259 INFO L427 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:17,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:17,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1461286794, now seen corresponding path program 661 times [2020-02-10 20:21:17,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:17,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382274022] [2020-02-10 20:21:17,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:17,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382274022] [2020-02-10 20:21:17,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:17,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:17,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769373622] [2020-02-10 20:21:17,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:17,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:17,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:17,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:17,779 INFO L87 Difference]: Start difference. First operand 1568 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:21:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:17,956 INFO L93 Difference]: Finished difference Result 2959 states and 11740 transitions. [2020-02-10 20:21:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:17,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:17,964 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:21:17,964 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:21:17,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:21:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1576. [2020-02-10 20:21:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:21:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7039 transitions. [2020-02-10 20:21:18,027 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7039 transitions. Word has length 28 [2020-02-10 20:21:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:18,028 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7039 transitions. [2020-02-10 20:21:18,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7039 transitions. [2020-02-10 20:21:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:18,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:18,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, 1, 1, 1] [2020-02-10 20:21:18,030 INFO L427 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash 889831988, now seen corresponding path program 662 times [2020-02-10 20:21:18,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:18,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672979112] [2020-02-10 20:21:18,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:18,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672979112] [2020-02-10 20:21:18,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:18,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:18,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151966870] [2020-02-10 20:21:18,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:18,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:18,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:18,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:18,543 INFO L87 Difference]: Start difference. First operand 1576 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:21:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:18,739 INFO L93 Difference]: Finished difference Result 2957 states and 11732 transitions. [2020-02-10 20:21:18,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:18,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:18,746 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:21:18,746 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:21:18,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:21:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1572. [2020-02-10 20:21:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:21:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7028 transitions. [2020-02-10 20:21:18,810 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7028 transitions. Word has length 28 [2020-02-10 20:21:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:18,810 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7028 transitions. [2020-02-10 20:21:18,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7028 transitions. [2020-02-10 20:21:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:18,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:18,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, 1, 1, 1] [2020-02-10 20:21:18,812 INFO L427 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:18,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:18,813 INFO L82 PathProgramCache]: Analyzing trace with hash 388201414, now seen corresponding path program 663 times [2020-02-10 20:21:18,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:18,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304680814] [2020-02-10 20:21:18,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:19,356 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:21:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:19,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304680814] [2020-02-10 20:21:19,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:19,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:19,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424640636] [2020-02-10 20:21:19,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:19,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:19,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:19,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:19,364 INFO L87 Difference]: Start difference. First operand 1572 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:21:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:19,547 INFO L93 Difference]: Finished difference Result 2964 states and 11748 transitions. [2020-02-10 20:21:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:19,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:19,554 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:21:19,555 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:21:19,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:19,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:21:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1578. [2020-02-10 20:21:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:21:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7039 transitions. [2020-02-10 20:21:19,618 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7039 transitions. Word has length 28 [2020-02-10 20:21:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:19,619 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7039 transitions. [2020-02-10 20:21:19,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7039 transitions. [2020-02-10 20:21:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:19,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:19,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, 1, 1, 1] [2020-02-10 20:21:19,621 INFO L427 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:19,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:19,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1306151604, now seen corresponding path program 664 times [2020-02-10 20:21:19,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:19,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843873776] [2020-02-10 20:21:19,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:20,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843873776] [2020-02-10 20:21:20,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:20,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:20,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051195953] [2020-02-10 20:21:20,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:20,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:20,148 INFO L87 Difference]: Start difference. First operand 1578 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:21:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:20,324 INFO L93 Difference]: Finished difference Result 2965 states and 11744 transitions. [2020-02-10 20:21:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:20,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:20,331 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:21:20,331 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:21:20,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:21:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1572. [2020-02-10 20:21:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:21:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7024 transitions. [2020-02-10 20:21:20,396 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7024 transitions. Word has length 28 [2020-02-10 20:21:20,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:20,396 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7024 transitions. [2020-02-10 20:21:20,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7024 transitions. [2020-02-10 20:21:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:20,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:20,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:20,399 INFO L427 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:20,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash -718483194, now seen corresponding path program 665 times [2020-02-10 20:21:20,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:20,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755328371] [2020-02-10 20:21:20,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:20,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755328371] [2020-02-10 20:21:20,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:20,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:20,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985509819] [2020-02-10 20:21:20,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:20,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:20,908 INFO L87 Difference]: Start difference. First operand 1572 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:21:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:21,099 INFO L93 Difference]: Finished difference Result 2958 states and 11730 transitions. [2020-02-10 20:21:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:21,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:21,107 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:21:21,107 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:21:21,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:21:21,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1576. [2020-02-10 20:21:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:21:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7031 transitions. [2020-02-10 20:21:21,170 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7031 transitions. Word has length 28 [2020-02-10 20:21:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:21,171 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7031 transitions. [2020-02-10 20:21:21,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7031 transitions. [2020-02-10 20:21:21,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:21,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:21,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:21,173 INFO L427 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:21,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:21,173 INFO L82 PathProgramCache]: Analyzing trace with hash 770921802, now seen corresponding path program 666 times [2020-02-10 20:21:21,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:21,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737549858] [2020-02-10 20:21:21,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:21,688 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:21:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:21,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737549858] [2020-02-10 20:21:21,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:21,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:21,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485775020] [2020-02-10 20:21:21,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:21,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:21,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:21,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:21,696 INFO L87 Difference]: Start difference. First operand 1576 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:21:21,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:21,869 INFO L93 Difference]: Finished difference Result 2961 states and 11732 transitions. [2020-02-10 20:21:21,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:21,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:21,876 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:21:21,876 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:21:21,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:21:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1568. [2020-02-10 20:21:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:21:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7013 transitions. [2020-02-10 20:21:21,939 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7013 transitions. Word has length 28 [2020-02-10 20:21:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:21,940 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7013 transitions. [2020-02-10 20:21:21,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7013 transitions. [2020-02-10 20:21:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:21,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:21,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:21,942 INFO L427 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:21,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:21,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2078474900, now seen corresponding path program 667 times [2020-02-10 20:21:21,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:21,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727936921] [2020-02-10 20:21:21,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:22,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727936921] [2020-02-10 20:21:22,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:22,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:22,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715895745] [2020-02-10 20:21:22,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:22,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:22,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:22,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:22,469 INFO L87 Difference]: Start difference. First operand 1568 states and 7013 transitions. Second operand 11 states. [2020-02-10 20:21:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:22,606 INFO L93 Difference]: Finished difference Result 2976 states and 11769 transitions. [2020-02-10 20:21:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:22,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:22,614 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:21:22,614 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:21:22,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:21:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1578. [2020-02-10 20:21:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:21:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7039 transitions. [2020-02-10 20:21:22,678 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7039 transitions. Word has length 28 [2020-02-10 20:21:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:22,679 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7039 transitions. [2020-02-10 20:21:22,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7039 transitions. [2020-02-10 20:21:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:22,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:22,681 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:22,681 INFO L427 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:22,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:22,681 INFO L82 PathProgramCache]: Analyzing trace with hash 900335092, now seen corresponding path program 668 times [2020-02-10 20:21:22,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:22,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700458269] [2020-02-10 20:21:22,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:23,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700458269] [2020-02-10 20:21:23,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:23,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:23,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770856468] [2020-02-10 20:21:23,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:23,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:23,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:23,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:23,207 INFO L87 Difference]: Start difference. First operand 1578 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:21:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:23,378 INFO L93 Difference]: Finished difference Result 2970 states and 11753 transitions. [2020-02-10 20:21:23,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:23,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:23,386 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:21:23,386 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:21:23,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:21:23,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1573. [2020-02-10 20:21:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:21:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7026 transitions. [2020-02-10 20:21:23,451 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7026 transitions. Word has length 28 [2020-02-10 20:21:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:23,451 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7026 transitions. [2020-02-10 20:21:23,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7026 transitions. [2020-02-10 20:21:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:23,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:23,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:23,454 INFO L427 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1143407016, now seen corresponding path program 669 times [2020-02-10 20:21:23,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:23,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082327567] [2020-02-10 20:21:23,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:23,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082327567] [2020-02-10 20:21:23,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:23,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:23,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718942720] [2020-02-10 20:21:23,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:23,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:23,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:23,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:23,991 INFO L87 Difference]: Start difference. First operand 1573 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:21:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:24,131 INFO L93 Difference]: Finished difference Result 2982 states and 11779 transitions. [2020-02-10 20:21:24,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:24,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:24,139 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:21:24,139 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:21:24,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:21:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1581. [2020-02-10 20:21:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:21:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7040 transitions. [2020-02-10 20:21:24,203 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7040 transitions. Word has length 28 [2020-02-10 20:21:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:24,203 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7040 transitions. [2020-02-10 20:21:24,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7040 transitions. [2020-02-10 20:21:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:24,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:24,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:24,206 INFO L427 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:24,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1316654708, now seen corresponding path program 670 times [2020-02-10 20:21:24,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:24,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232758404] [2020-02-10 20:21:24,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:24,733 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:21:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:24,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232758404] [2020-02-10 20:21:24,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:24,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:24,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217493953] [2020-02-10 20:21:24,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:24,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:24,740 INFO L87 Difference]: Start difference. First operand 1581 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:21:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:24,915 INFO L93 Difference]: Finished difference Result 2979 states and 11766 transitions. [2020-02-10 20:21:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:24,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:24,942 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:21:24,943 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:21:24,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:24,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:21:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1573. [2020-02-10 20:21:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:21:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7021 transitions. [2020-02-10 20:21:25,005 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7021 transitions. Word has length 28 [2020-02-10 20:21:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:25,005 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7021 transitions. [2020-02-10 20:21:25,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7021 transitions. [2020-02-10 20:21:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:25,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:25,007 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:25,008 INFO L427 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:25,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:25,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1976046248, now seen corresponding path program 671 times [2020-02-10 20:21:25,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:25,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467397531] [2020-02-10 20:21:25,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:25,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467397531] [2020-02-10 20:21:25,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:25,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:25,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908432656] [2020-02-10 20:21:25,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:25,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:25,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:25,546 INFO L87 Difference]: Start difference. First operand 1573 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:21:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:25,721 INFO L93 Difference]: Finished difference Result 2966 states and 11741 transitions. [2020-02-10 20:21:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:25,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:25,728 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:21:25,728 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:21:25,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:21:25,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1577. [2020-02-10 20:21:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:21:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7028 transitions. [2020-02-10 20:21:25,792 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7028 transitions. Word has length 28 [2020-02-10 20:21:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:25,792 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7028 transitions. [2020-02-10 20:21:25,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7028 transitions. [2020-02-10 20:21:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:25,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:25,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:25,794 INFO L427 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash -829516052, now seen corresponding path program 672 times [2020-02-10 20:21:25,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:25,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350385435] [2020-02-10 20:21:25,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:26,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350385435] [2020-02-10 20:21:26,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:26,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:26,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114818424] [2020-02-10 20:21:26,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:26,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:26,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:26,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:26,322 INFO L87 Difference]: Start difference. First operand 1577 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:21:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:26,506 INFO L93 Difference]: Finished difference Result 2969 states and 11743 transitions. [2020-02-10 20:21:26,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:26,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:26,514 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:21:26,514 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:21:26,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:21:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1563. [2020-02-10 20:21:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:21:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 6999 transitions. [2020-02-10 20:21:26,578 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 6999 transitions. Word has length 28 [2020-02-10 20:21:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:26,578 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 6999 transitions. [2020-02-10 20:21:26,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 6999 transitions. [2020-02-10 20:21:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:26,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:26,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:26,580 INFO L427 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:26,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2033247324, now seen corresponding path program 673 times [2020-02-10 20:21:26,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:26,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841767935] [2020-02-10 20:21:26,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:27,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841767935] [2020-02-10 20:21:27,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:27,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:27,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624340698] [2020-02-10 20:21:27,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:27,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:27,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:27,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:27,091 INFO L87 Difference]: Start difference. First operand 1563 states and 6999 transitions. Second operand 11 states. [2020-02-10 20:21:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:27,270 INFO L93 Difference]: Finished difference Result 2957 states and 11739 transitions. [2020-02-10 20:21:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:27,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:27,278 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:21:27,278 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:21:27,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:21:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1577. [2020-02-10 20:21:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:21:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7044 transitions. [2020-02-10 20:21:27,342 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7044 transitions. Word has length 28 [2020-02-10 20:21:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:27,343 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7044 transitions. [2020-02-10 20:21:27,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7044 transitions. [2020-02-10 20:21:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:27,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:27,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:27,345 INFO L427 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:27,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash -543842328, now seen corresponding path program 674 times [2020-02-10 20:21:27,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:27,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118303187] [2020-02-10 20:21:27,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:27,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118303187] [2020-02-10 20:21:27,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:27,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:27,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501677540] [2020-02-10 20:21:27,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:27,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:27,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:27,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:27,856 INFO L87 Difference]: Start difference. First operand 1577 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:21:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:28,060 INFO L93 Difference]: Finished difference Result 2959 states and 11737 transitions. [2020-02-10 20:21:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:28,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:28,068 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:21:28,068 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:21:28,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:21:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1571. [2020-02-10 20:21:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:21:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7029 transitions. [2020-02-10 20:21:28,131 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7029 transitions. Word has length 28 [2020-02-10 20:21:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:28,131 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7029 transitions. [2020-02-10 20:21:28,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7029 transitions. [2020-02-10 20:21:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:28,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:28,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:28,134 INFO L427 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:28,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1495391746, now seen corresponding path program 675 times [2020-02-10 20:21:28,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:28,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062002108] [2020-02-10 20:21:28,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:28,641 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:21:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:28,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062002108] [2020-02-10 20:21:28,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:28,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:28,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541979609] [2020-02-10 20:21:28,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:28,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:28,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:28,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:28,649 INFO L87 Difference]: Start difference. First operand 1571 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:21:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:28,838 INFO L93 Difference]: Finished difference Result 2951 states and 11721 transitions. [2020-02-10 20:21:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:28,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:28,846 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:21:28,846 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:21:28,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:21:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1575. [2020-02-10 20:21:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:21:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7036 transitions. [2020-02-10 20:21:28,909 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7036 transitions. Word has length 28 [2020-02-10 20:21:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:28,909 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7036 transitions. [2020-02-10 20:21:28,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7036 transitions. [2020-02-10 20:21:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:28,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:28,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:28,912 INFO L427 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:28,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2066846552, now seen corresponding path program 676 times [2020-02-10 20:21:28,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:28,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351082785] [2020-02-10 20:21:28,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21: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-02-10 20:21:29,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351082785] [2020-02-10 20:21:29,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:29,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:29,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406662466] [2020-02-10 20:21:29,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:29,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:29,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:29,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:29,430 INFO L87 Difference]: Start difference. First operand 1575 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:21:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:29,612 INFO L93 Difference]: Finished difference Result 2949 states and 11713 transitions. [2020-02-10 20:21:29,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:29,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:29,619 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:21:29,619 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 20:21:29,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 20:21:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1571. [2020-02-10 20:21:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:21:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7025 transitions. [2020-02-10 20:21:29,684 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7025 transitions. Word has length 28 [2020-02-10 20:21:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:29,684 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7025 transitions. [2020-02-10 20:21:29,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7025 transitions. [2020-02-10 20:21:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:29,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:29,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:29,686 INFO L427 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:29,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1079072130, now seen corresponding path program 677 times [2020-02-10 20:21:29,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:29,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129045715] [2020-02-10 20:21:29,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:30,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129045715] [2020-02-10 20:21:30,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:30,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:30,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871404547] [2020-02-10 20:21:30,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:30,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:30,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:30,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:30,209 INFO L87 Difference]: Start difference. First operand 1571 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:21:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:30,386 INFO L93 Difference]: Finished difference Result 2955 states and 11725 transitions. [2020-02-10 20:21:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:30,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:30,393 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:21:30,393 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:21:30,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:21:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1575. [2020-02-10 20:21:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:21:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7032 transitions. [2020-02-10 20:21:30,458 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7032 transitions. Word has length 28 [2020-02-10 20:21:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:30,458 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7032 transitions. [2020-02-10 20:21:30,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7032 transitions. [2020-02-10 20:21:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:30,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:30,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:30,460 INFO L427 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1155035364, now seen corresponding path program 678 times [2020-02-10 20:21:30,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:30,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599860749] [2020-02-10 20:21:30,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:31,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599860749] [2020-02-10 20:21:31,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:31,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:31,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895943207] [2020-02-10 20:21:31,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:31,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:31,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:31,002 INFO L87 Difference]: Start difference. First operand 1575 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:21:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:31,214 INFO L93 Difference]: Finished difference Result 2951 states and 11713 transitions. [2020-02-10 20:21:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:31,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:31,222 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:21:31,222 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:21:31,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:21:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1567. [2020-02-10 20:21:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:21:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7014 transitions. [2020-02-10 20:21:31,285 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7014 transitions. Word has length 28 [2020-02-10 20:21:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:31,285 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7014 transitions. [2020-02-10 20:21:31,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7014 transitions. [2020-02-10 20:21:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:31,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:31,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, 1, 1, 1] [2020-02-10 20:21:31,287 INFO L427 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:31,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash -939155736, now seen corresponding path program 679 times [2020-02-10 20:21:31,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:31,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326993256] [2020-02-10 20:21:31,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:31,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326993256] [2020-02-10 20:21:31,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:31,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:31,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310004091] [2020-02-10 20:21:31,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:31,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:31,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:31,807 INFO L87 Difference]: Start difference. First operand 1567 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:21:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:31,999 INFO L93 Difference]: Finished difference Result 2967 states and 11764 transitions. [2020-02-10 20:21:31,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:31,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:32,006 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:21:32,007 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:21:32,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:21:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1579. [2020-02-10 20:21:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:21:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7048 transitions. [2020-02-10 20:21:32,072 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7048 transitions. Word has length 28 [2020-02-10 20:21:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:32,072 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7048 transitions. [2020-02-10 20:21:32,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7048 transitions. [2020-02-10 20:21:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:32,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:32,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:32,075 INFO L427 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:32,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:32,075 INFO L82 PathProgramCache]: Analyzing trace with hash 550249260, now seen corresponding path program 680 times [2020-02-10 20:21:32,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:32,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858115347] [2020-02-10 20:21:32,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:32,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858115347] [2020-02-10 20:21:32,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:32,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:32,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432384380] [2020-02-10 20:21:32,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:32,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:32,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:32,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:32,587 INFO L87 Difference]: Start difference. First operand 1579 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:21:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:32,833 INFO L93 Difference]: Finished difference Result 2969 states and 11762 transitions. [2020-02-10 20:21:32,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:32,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:32,841 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:21:32,841 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:21:32,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:21:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1573. [2020-02-10 20:21:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:21:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7031 transitions. [2020-02-10 20:21:32,904 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7031 transitions. Word has length 28 [2020-02-10 20:21:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:32,905 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7031 transitions. [2020-02-10 20:21:32,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7031 transitions. [2020-02-10 20:21:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:32,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:32,907 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:32,907 INFO L427 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:32,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:32,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1474385538, now seen corresponding path program 681 times [2020-02-10 20:21:32,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:32,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670728160] [2020-02-10 20:21:32,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:33,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670728160] [2020-02-10 20:21:33,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:33,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:33,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38161535] [2020-02-10 20:21:33,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:33,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:33,435 INFO L87 Difference]: Start difference. First operand 1573 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:21:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:33,671 INFO L93 Difference]: Finished difference Result 2966 states and 11756 transitions. [2020-02-10 20:21:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:33,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:33,678 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:21:33,678 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:21:33,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:21:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1579. [2020-02-10 20:21:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:21:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7042 transitions. [2020-02-10 20:21:33,744 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7042 transitions. Word has length 28 [2020-02-10 20:21:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:33,744 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7042 transitions. [2020-02-10 20:21:33,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7042 transitions. [2020-02-10 20:21:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:33,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:33,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:33,746 INFO L427 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:33,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:33,747 INFO L82 PathProgramCache]: Analyzing trace with hash -556435348, now seen corresponding path program 682 times [2020-02-10 20:21:33,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:33,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869432826] [2020-02-10 20:21:33,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:34,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869432826] [2020-02-10 20:21:34,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:34,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:34,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48551286] [2020-02-10 20:21:34,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:34,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:34,280 INFO L87 Difference]: Start difference. First operand 1579 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:21:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:34,475 INFO L93 Difference]: Finished difference Result 2967 states and 11752 transitions. [2020-02-10 20:21:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:34,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:34,483 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:21:34,484 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:21:34,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:21:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1573. [2020-02-10 20:21:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:21:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7025 transitions. [2020-02-10 20:21:34,547 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7025 transitions. Word has length 28 [2020-02-10 20:21:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:34,547 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7025 transitions. [2020-02-10 20:21:34,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7025 transitions. [2020-02-10 20:21:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:34,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:34,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:34,549 INFO L427 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:34,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1058065922, now seen corresponding path program 683 times [2020-02-10 20:21:34,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:34,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315081280] [2020-02-10 20:21:34,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:35,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315081280] [2020-02-10 20:21:35,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:35,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:35,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435026160] [2020-02-10 20:21:35,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:35,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:35,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:35,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:35,073 INFO L87 Difference]: Start difference. First operand 1573 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:21:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:35,261 INFO L93 Difference]: Finished difference Result 2971 states and 11761 transitions. [2020-02-10 20:21:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:35,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:35,269 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 20:21:35,269 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:21:35,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:21:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1580. [2020-02-10 20:21:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:21:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7038 transitions. [2020-02-10 20:21:35,335 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7038 transitions. Word has length 28 [2020-02-10 20:21:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:35,335 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7038 transitions. [2020-02-10 20:21:35,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7038 transitions. [2020-02-10 20:21:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:35,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:35,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:35,337 INFO L427 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:35,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1629520728, now seen corresponding path program 684 times [2020-02-10 20:21:35,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:35,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545648658] [2020-02-10 20:21:35,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:35,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545648658] [2020-02-10 20:21:35,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:35,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:35,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165553993] [2020-02-10 20:21:35,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:35,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:35,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:35,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:35,871 INFO L87 Difference]: Start difference. First operand 1580 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:21:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:36,061 INFO L93 Difference]: Finished difference Result 2970 states and 11752 transitions. [2020-02-10 20:21:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:36,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:36,068 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:21:36,068 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:21:36,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:21:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1567. [2020-02-10 20:21:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:21:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7010 transitions. [2020-02-10 20:21:36,131 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7010 transitions. Word has length 28 [2020-02-10 20:21:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:36,132 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7010 transitions. [2020-02-10 20:21:36,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7010 transitions. [2020-02-10 20:21:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:36,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:36,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:36,134 INFO L427 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:36,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash -907646424, now seen corresponding path program 685 times [2020-02-10 20:21:36,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:36,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910430944] [2020-02-10 20:21:36,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:36,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910430944] [2020-02-10 20:21:36,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:36,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:36,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126074713] [2020-02-10 20:21:36,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:36,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:36,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:36,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:36,670 INFO L87 Difference]: Start difference. First operand 1567 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:21:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:36,850 INFO L93 Difference]: Finished difference Result 2950 states and 11715 transitions. [2020-02-10 20:21:36,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:36,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:36,857 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:21:36,858 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:21:36,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:36,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:21:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1575. [2020-02-10 20:21:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:21:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7032 transitions. [2020-02-10 20:21:36,924 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7032 transitions. Word has length 28 [2020-02-10 20:21:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:36,924 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7032 transitions. [2020-02-10 20:21:36,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7032 transitions. [2020-02-10 20:21:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:36,926 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:36,926 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:36,926 INFO L427 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:36,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1479101230, now seen corresponding path program 686 times [2020-02-10 20:21:36,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:36,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790037085] [2020-02-10 20:21:36,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:37,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790037085] [2020-02-10 20:21:37,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:37,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:37,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962506706] [2020-02-10 20:21:37,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:37,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:37,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:37,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:37,439 INFO L87 Difference]: Start difference. First operand 1575 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:21:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:37,623 INFO L93 Difference]: Finished difference Result 2948 states and 11707 transitions. [2020-02-10 20:21:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:37,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:37,631 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:21:37,631 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:21:37,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:21:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1571. [2020-02-10 20:21:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:21:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7021 transitions. [2020-02-10 20:21:37,696 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7021 transitions. Word has length 28 [2020-02-10 20:21:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:37,696 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7021 transitions. [2020-02-10 20:21:37,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7021 transitions. [2020-02-10 20:21:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:37,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:37,699 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:37,699 INFO L427 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:37,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1980731804, now seen corresponding path program 687 times [2020-02-10 20:21:37,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:37,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21382234] [2020-02-10 20:21:37,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:38,211 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:21:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:38,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21382234] [2020-02-10 20:21:38,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:38,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:38,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972993912] [2020-02-10 20:21:38,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:38,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:38,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:38,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:38,219 INFO L87 Difference]: Start difference. First operand 1571 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:21:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:38,429 INFO L93 Difference]: Finished difference Result 2955 states and 11723 transitions. [2020-02-10 20:21:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:38,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:38,437 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:21:38,437 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:21:38,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:21:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1577. [2020-02-10 20:21:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:21:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7032 transitions. [2020-02-10 20:21:38,503 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7032 transitions. Word has length 28 [2020-02-10 20:21:38,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:38,503 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7032 transitions. [2020-02-10 20:21:38,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7032 transitions. [2020-02-10 20:21:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:38,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:38,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:38,505 INFO L427 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:38,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:38,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1062781614, now seen corresponding path program 688 times [2020-02-10 20:21:38,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:38,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602342022] [2020-02-10 20:21:38,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:39,038 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:21:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:39,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602342022] [2020-02-10 20:21:39,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:39,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:39,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791413835] [2020-02-10 20:21:39,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:39,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:39,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:39,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:39,047 INFO L87 Difference]: Start difference. First operand 1577 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:21:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:39,248 INFO L93 Difference]: Finished difference Result 2956 states and 11719 transitions. [2020-02-10 20:21:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:39,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:39,255 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:21:39,255 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:21:39,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:21:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1571. [2020-02-10 20:21:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:21:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7017 transitions. [2020-02-10 20:21:39,319 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7017 transitions. Word has length 28 [2020-02-10 20:21:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:39,319 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7017 transitions. [2020-02-10 20:21:39,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7017 transitions. [2020-02-10 20:21:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:39,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:39,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:39,322 INFO L427 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1207550884, now seen corresponding path program 689 times [2020-02-10 20:21:39,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:39,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359391127] [2020-02-10 20:21:39,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:39,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359391127] [2020-02-10 20:21:39,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:39,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:39,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676505543] [2020-02-10 20:21:39,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:39,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:39,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:39,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:39,842 INFO L87 Difference]: Start difference. First operand 1571 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:21:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:40,021 INFO L93 Difference]: Finished difference Result 2949 states and 11705 transitions. [2020-02-10 20:21:40,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:40,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:40,028 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:21:40,029 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:21:40,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:21:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1575. [2020-02-10 20:21:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:21:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7024 transitions. [2020-02-10 20:21:40,092 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7024 transitions. Word has length 28 [2020-02-10 20:21:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:40,092 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7024 transitions. [2020-02-10 20:21:40,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7024 transitions. [2020-02-10 20:21:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:40,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:40,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:40,095 INFO L427 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:40,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:40,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1598011416, now seen corresponding path program 690 times [2020-02-10 20:21:40,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:40,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693167506] [2020-02-10 20:21:40,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:40,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693167506] [2020-02-10 20:21:40,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:40,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:40,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460219951] [2020-02-10 20:21:40,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:40,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:40,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:40,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:40,631 INFO L87 Difference]: Start difference. First operand 1575 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:21:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:40,818 INFO L93 Difference]: Finished difference Result 2952 states and 11707 transitions. [2020-02-10 20:21:40,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:40,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:40,826 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:21:40,826 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:21:40,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:21:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1567. [2020-02-10 20:21:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:21:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7006 transitions. [2020-02-10 20:21:40,889 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7006 transitions. Word has length 28 [2020-02-10 20:21:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:40,889 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7006 transitions. [2020-02-10 20:21:40,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7006 transitions. [2020-02-10 20:21:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:40,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:40,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:40,892 INFO L427 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash 602764780, now seen corresponding path program 691 times [2020-02-10 20:21:40,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:40,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678280790] [2020-02-10 20:21:40,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:41,408 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:21:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:41,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678280790] [2020-02-10 20:21:41,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:41,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:41,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616281640] [2020-02-10 20:21:41,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:41,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:41,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:41,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:41,416 INFO L87 Difference]: Start difference. First operand 1567 states and 7006 transitions. Second operand 11 states. [2020-02-10 20:21:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:41,619 INFO L93 Difference]: Finished difference Result 2957 states and 11726 transitions. [2020-02-10 20:21:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:41,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:41,626 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:21:41,627 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:21:41,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:21:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1575. [2020-02-10 20:21:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:21:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7028 transitions. [2020-02-10 20:21:41,690 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7028 transitions. Word has length 28 [2020-02-10 20:21:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:41,690 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7028 transitions. [2020-02-10 20:21:41,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7028 transitions. [2020-02-10 20:21:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:41,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:41,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:41,693 INFO L427 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:41,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1458095022, now seen corresponding path program 692 times [2020-02-10 20:21:41,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:41,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747172203] [2020-02-10 20:21:41,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:42,114 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2020-02-10 20:21:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:42,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747172203] [2020-02-10 20:21:42,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:42,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:42,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915845425] [2020-02-10 20:21:42,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:42,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:42,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:42,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:42,238 INFO L87 Difference]: Start difference. First operand 1575 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:21:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:42,406 INFO L93 Difference]: Finished difference Result 2953 states and 11714 transitions. [2020-02-10 20:21:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:42,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:42,414 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:21:42,414 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:21:42,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:21:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1571. [2020-02-10 20:21:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:21:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7017 transitions. [2020-02-10 20:21:42,479 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7017 transitions. Word has length 28 [2020-02-10 20:21:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:42,479 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7017 transitions. [2020-02-10 20:21:42,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7017 transitions. [2020-02-10 20:21:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:42,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:42,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:42,481 INFO L427 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash -470320600, now seen corresponding path program 693 times [2020-02-10 20:21:42,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:42,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746898930] [2020-02-10 20:21:42,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:43,001 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:21:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:43,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746898930] [2020-02-10 20:21:43,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:43,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:43,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560961968] [2020-02-10 20:21:43,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:43,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:43,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:43,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:43,008 INFO L87 Difference]: Start difference. First operand 1571 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:21:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:43,203 INFO L93 Difference]: Finished difference Result 2963 states and 11737 transitions. [2020-02-10 20:21:43,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:43,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:43,211 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:21:43,211 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:21:43,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:21:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1578. [2020-02-10 20:21:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:21:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7030 transitions. [2020-02-10 20:21:43,275 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7030 transitions. Word has length 28 [2020-02-10 20:21:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:43,275 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7030 transitions. [2020-02-10 20:21:43,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7030 transitions. [2020-02-10 20:21:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:43,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:43,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:43,277 INFO L427 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1041775406, now seen corresponding path program 694 times [2020-02-10 20:21:43,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:43,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937665477] [2020-02-10 20:21:43,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:43,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937665477] [2020-02-10 20:21:43,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:43,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:43,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436646373] [2020-02-10 20:21:43,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:43,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:43,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:43,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:43,803 INFO L87 Difference]: Start difference. First operand 1578 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:21:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:43,978 INFO L93 Difference]: Finished difference Result 2962 states and 11728 transitions. [2020-02-10 20:21:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:43,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:43,986 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:21:43,987 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:21:43,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:21:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1571. [2020-02-10 20:21:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:21:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7013 transitions. [2020-02-10 20:21:44,050 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7013 transitions. Word has length 28 [2020-02-10 20:21:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:44,050 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7013 transitions. [2020-02-10 20:21:44,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7013 transitions. [2020-02-10 20:21:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:44,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:44,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:44,053 INFO L427 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1993324824, now seen corresponding path program 695 times [2020-02-10 20:21:44,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:44,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440463224] [2020-02-10 20:21:44,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:44,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440463224] [2020-02-10 20:21:44,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:44,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:44,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916291262] [2020-02-10 20:21:44,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:44,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:44,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:44,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:44,575 INFO L87 Difference]: Start difference. First operand 1571 states and 7013 transitions. Second operand 11 states. [2020-02-10 20:21:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:44,755 INFO L93 Difference]: Finished difference Result 2952 states and 11708 transitions. [2020-02-10 20:21:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:44,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:44,762 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:21:44,762 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:21:44,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:21:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1575. [2020-02-10 20:21:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:21:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7020 transitions. [2020-02-10 20:21:44,826 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7020 transitions. Word has length 28 [2020-02-10 20:21:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:44,826 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7020 transitions. [2020-02-10 20:21:44,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7020 transitions. [2020-02-10 20:21:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:44,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:44,828 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:44,828 INFO L427 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:44,828 INFO L82 PathProgramCache]: Analyzing trace with hash -503919828, now seen corresponding path program 696 times [2020-02-10 20:21:44,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:44,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082551754] [2020-02-10 20:21:44,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:45,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082551754] [2020-02-10 20:21:45,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:45,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:45,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431631252] [2020-02-10 20:21:45,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:45,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:45,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:45,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:45,355 INFO L87 Difference]: Start difference. First operand 1575 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:21:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:45,558 INFO L93 Difference]: Finished difference Result 2955 states and 11710 transitions. [2020-02-10 20:21:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:45,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:45,566 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:21:45,566 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:21:45,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:21:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1563. [2020-02-10 20:21:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:21:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 6995 transitions. [2020-02-10 20:21:45,630 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 6995 transitions. Word has length 28 [2020-02-10 20:21:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:45,630 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 6995 transitions. [2020-02-10 20:21:45,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 6995 transitions. [2020-02-10 20:21:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:45,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:45,632 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:45,633 INFO L427 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash 647992356, now seen corresponding path program 697 times [2020-02-10 20:21:45,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:45,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460103508] [2020-02-10 20:21:45,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:46,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460103508] [2020-02-10 20:21:46,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:46,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:46,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916508094] [2020-02-10 20:21:46,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:46,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:46,182 INFO L87 Difference]: Start difference. First operand 1563 states and 6995 transitions. Second operand 11 states. [2020-02-10 20:21:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:46,325 INFO L93 Difference]: Finished difference Result 3001 states and 11831 transitions. [2020-02-10 20:21:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:46,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:46,332 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:21:46,332 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:21:46,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:46,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:21:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1586. [2020-02-10 20:21:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:21:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7060 transitions. [2020-02-10 20:21:46,396 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7060 transitions. Word has length 28 [2020-02-10 20:21:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:46,396 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7060 transitions. [2020-02-10 20:21:46,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7060 transitions. [2020-02-10 20:21:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:46,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:46,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:46,399 INFO L427 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:46,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1392694854, now seen corresponding path program 698 times [2020-02-10 20:21:46,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:46,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230707834] [2020-02-10 20:21:46,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:46,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230707834] [2020-02-10 20:21:46,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:46,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:46,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159314040] [2020-02-10 20:21:46,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:46,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:46,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:46,953 INFO L87 Difference]: Start difference. First operand 1586 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:21:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:47,126 INFO L93 Difference]: Finished difference Result 2999 states and 11819 transitions. [2020-02-10 20:21:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:47,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:47,134 INFO L225 Difference]: With dead ends: 2999 [2020-02-10 20:21:47,134 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:21:47,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:21:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1576. [2020-02-10 20:21:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:21:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7037 transitions. [2020-02-10 20:21:47,197 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7037 transitions. Word has length 28 [2020-02-10 20:21:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:47,198 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7037 transitions. [2020-02-10 20:21:47,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7037 transitions. [2020-02-10 20:21:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:47,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:47,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:47,200 INFO L427 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:47,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:47,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1185847934, now seen corresponding path program 699 times [2020-02-10 20:21:47,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:47,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019265407] [2020-02-10 20:21:47,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:47,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019265407] [2020-02-10 20:21:47,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:47,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:47,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226771458] [2020-02-10 20:21:47,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:47,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:47,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:47,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:47,730 INFO L87 Difference]: Start difference. First operand 1576 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:21:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:47,885 INFO L93 Difference]: Finished difference Result 2992 states and 11804 transitions. [2020-02-10 20:21:47,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:47,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:47,892 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:21:47,892 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 20:21:47,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 20:21:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1581. [2020-02-10 20:21:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:21:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7045 transitions. [2020-02-10 20:21:47,956 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7045 transitions. Word has length 28 [2020-02-10 20:21:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:47,956 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7045 transitions. [2020-02-10 20:21:47,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7045 transitions. [2020-02-10 20:21:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:47,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:47,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:47,958 INFO L427 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:47,958 INFO L82 PathProgramCache]: Analyzing trace with hash -130309370, now seen corresponding path program 700 times [2020-02-10 20:21:47,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:47,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119970167] [2020-02-10 20:21:47,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:48,485 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:21:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:48,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119970167] [2020-02-10 20:21:48,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:48,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:48,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557874644] [2020-02-10 20:21:48,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:48,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:48,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:48,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:48,492 INFO L87 Difference]: Start difference. First operand 1581 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:21:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:48,711 INFO L93 Difference]: Finished difference Result 2986 states and 11788 transitions. [2020-02-10 20:21:48,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:48,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:48,719 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:21:48,719 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 20:21:48,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 20:21:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1576. [2020-02-10 20:21:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:21:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7032 transitions. [2020-02-10 20:21:48,782 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7032 transitions. Word has length 28 [2020-02-10 20:21:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:48,782 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7032 transitions. [2020-02-10 20:21:48,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7032 transitions. [2020-02-10 20:21:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:48,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:48,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:48,785 INFO L427 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:48,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:48,785 INFO L82 PathProgramCache]: Analyzing trace with hash -753475906, now seen corresponding path program 701 times [2020-02-10 20:21:48,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:48,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224253330] [2020-02-10 20:21:48,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:49,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224253330] [2020-02-10 20:21:49,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:49,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:49,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429267281] [2020-02-10 20:21:49,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:49,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:49,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:49,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:49,307 INFO L87 Difference]: Start difference. First operand 1576 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:21:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:49,475 INFO L93 Difference]: Finished difference Result 2987 states and 11791 transitions. [2020-02-10 20:21:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:49,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:49,482 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 20:21:49,483 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:21:49,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:21:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1580. [2020-02-10 20:21:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:21:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7039 transitions. [2020-02-10 20:21:49,546 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7039 transitions. Word has length 28 [2020-02-10 20:21:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:49,546 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7039 transitions. [2020-02-10 20:21:49,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7039 transitions. [2020-02-10 20:21:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:49,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:49,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:49,549 INFO L427 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1480631588, now seen corresponding path program 702 times [2020-02-10 20:21:49,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:49,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779164501] [2020-02-10 20:21:49,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:50,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779164501] [2020-02-10 20:21:50,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:50,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:50,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795245434] [2020-02-10 20:21:50,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:50,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:50,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:50,075 INFO L87 Difference]: Start difference. First operand 1580 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:21:50,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:50,253 INFO L93 Difference]: Finished difference Result 2983 states and 11779 transitions. [2020-02-10 20:21:50,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:50,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:50,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:50,261 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:21:50,262 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:21:50,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:21:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1570. [2020-02-10 20:21:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:21:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7017 transitions. [2020-02-10 20:21:50,325 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7017 transitions. Word has length 28 [2020-02-10 20:21:50,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:50,325 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7017 transitions. [2020-02-10 20:21:50,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7017 transitions. [2020-02-10 20:21:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:50,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:50,328 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:50,328 INFO L427 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:50,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1742083944, now seen corresponding path program 703 times [2020-02-10 20:21:50,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:50,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532578746] [2020-02-10 20:21:50,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:50,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532578746] [2020-02-10 20:21:50,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:50,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:50,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349913037] [2020-02-10 20:21:50,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:50,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:50,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:50,878 INFO L87 Difference]: Start difference. First operand 1570 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:21:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:51,045 INFO L93 Difference]: Finished difference Result 3014 states and 11862 transitions. [2020-02-10 20:21:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:51,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:51,052 INFO L225 Difference]: With dead ends: 3014 [2020-02-10 20:21:51,053 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 20:21:51,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 20:21:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1590. [2020-02-10 20:21:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:21:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7067 transitions. [2020-02-10 20:21:51,117 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7067 transitions. Word has length 28 [2020-02-10 20:21:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:51,117 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7067 transitions. [2020-02-10 20:21:51,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7067 transitions. [2020-02-10 20:21:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:51,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:51,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:51,119 INFO L427 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:51,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:51,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1808180854, now seen corresponding path program 704 times [2020-02-10 20:21:51,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:51,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817772496] [2020-02-10 20:21:51,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:51,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817772496] [2020-02-10 20:21:51,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:51,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:51,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058909335] [2020-02-10 20:21:51,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:51,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:51,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:51,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:51,672 INFO L87 Difference]: Start difference. First operand 1590 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:21:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:51,886 INFO L93 Difference]: Finished difference Result 3012 states and 11850 transitions. [2020-02-10 20:21:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:51,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:51,893 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:21:51,893 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 20:21:51,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 20:21:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1580. [2020-02-10 20:21:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:21:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7041 transitions. [2020-02-10 20:21:51,957 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7041 transitions. Word has length 28 [2020-02-10 20:21:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:51,957 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7041 transitions. [2020-02-10 20:21:51,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7041 transitions. [2020-02-10 20:21:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:51,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:51,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:51,960 INFO L427 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:51,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1206854142, now seen corresponding path program 705 times [2020-02-10 20:21:51,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:51,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133082320] [2020-02-10 20:21:51,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:52,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133082320] [2020-02-10 20:21:52,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:52,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:52,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714933666] [2020-02-10 20:21:52,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:52,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:52,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:52,500 INFO L87 Difference]: Start difference. First operand 1580 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:21:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:52,638 INFO L93 Difference]: Finished difference Result 3011 states and 11847 transitions. [2020-02-10 20:21:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:52,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:52,645 INFO L225 Difference]: With dead ends: 3011 [2020-02-10 20:21:52,645 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:21:52,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:21:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1588. [2020-02-10 20:21:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:21:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7055 transitions. [2020-02-10 20:21:52,711 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7055 transitions. Word has length 28 [2020-02-10 20:21:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:52,711 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7055 transitions. [2020-02-10 20:21:52,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7055 transitions. [2020-02-10 20:21:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:52,713 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:52,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, 1, 1, 1] [2020-02-10 20:21:52,713 INFO L427 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:52,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:52,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1380101834, now seen corresponding path program 706 times [2020-02-10 20:21:52,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:52,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602872597] [2020-02-10 20:21:52,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:53,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602872597] [2020-02-10 20:21:53,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:53,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:53,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487796176] [2020-02-10 20:21:53,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:53,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:53,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:53,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:53,249 INFO L87 Difference]: Start difference. First operand 1588 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:21:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:53,454 INFO L93 Difference]: Finished difference Result 3008 states and 11834 transitions. [2020-02-10 20:21:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:53,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:53,462 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 20:21:53,462 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:21:53,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:21:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1580. [2020-02-10 20:21:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:21:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7033 transitions. [2020-02-10 20:21:53,554 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7033 transitions. Word has length 28 [2020-02-10 20:21:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:53,554 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7033 transitions. [2020-02-10 20:21:53,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7033 transitions. [2020-02-10 20:21:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:53,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:53,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:53,557 INFO L427 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:53,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash -732469698, now seen corresponding path program 707 times [2020-02-10 20:21:53,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:53,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908370480] [2020-02-10 20:21:53,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:54,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908370480] [2020-02-10 20:21:54,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:54,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:54,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014710571] [2020-02-10 20:21:54,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:54,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:54,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:54,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:54,105 INFO L87 Difference]: Start difference. First operand 1580 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:21:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:54,295 INFO L93 Difference]: Finished difference Result 3006 states and 11831 transitions. [2020-02-10 20:21:54,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:54,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:54,302 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:21:54,302 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 20:21:54,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 20:21:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1587. [2020-02-10 20:21:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:21:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7046 transitions. [2020-02-10 20:21:54,366 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7046 transitions. Word has length 28 [2020-02-10 20:21:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:54,366 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7046 transitions. [2020-02-10 20:21:54,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7046 transitions. [2020-02-10 20:21:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:54,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:54,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:54,368 INFO L427 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:54,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:54,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1303924504, now seen corresponding path program 708 times [2020-02-10 20:21:54,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:54,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194504540] [2020-02-10 20:21:54,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:54,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194504540] [2020-02-10 20:21:54,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:54,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:54,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567424712] [2020-02-10 20:21:54,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:54,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:54,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:54,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:54,903 INFO L87 Difference]: Start difference. First operand 1587 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:21:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:55,092 INFO L93 Difference]: Finished difference Result 3005 states and 11822 transitions. [2020-02-10 20:21:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:55,093 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:55,100 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:21:55,101 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:21:55,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:21:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1570. [2020-02-10 20:21:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:21:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7010 transitions. [2020-02-10 20:21:55,164 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7010 transitions. Word has length 28 [2020-02-10 20:21:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:55,164 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7010 transitions. [2020-02-10 20:21:55,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7010 transitions. [2020-02-10 20:21:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:55,166 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:55,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:55,167 INFO L427 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:55,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1773593256, now seen corresponding path program 709 times [2020-02-10 20:21:55,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:55,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513632269] [2020-02-10 20:21:55,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:55,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513632269] [2020-02-10 20:21:55,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:55,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:55,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654053933] [2020-02-10 20:21:55,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:55,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:55,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:55,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:55,705 INFO L87 Difference]: Start difference. First operand 1570 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:21:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:55,872 INFO L93 Difference]: Finished difference Result 2988 states and 11789 transitions. [2020-02-10 20:21:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:55,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:55,879 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:21:55,880 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:21:55,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:55,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:21:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1580. [2020-02-10 20:21:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:21:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7036 transitions. [2020-02-10 20:21:55,944 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7036 transitions. Word has length 28 [2020-02-10 20:21:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:55,945 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7036 transitions. [2020-02-10 20:21:55,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7036 transitions. [2020-02-10 20:21:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:55,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:55,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:55,947 INFO L427 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:55,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:55,947 INFO L82 PathProgramCache]: Analyzing trace with hash 457435952, now seen corresponding path program 710 times [2020-02-10 20:21:55,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:55,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318153685] [2020-02-10 20:21:55,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:56,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318153685] [2020-02-10 20:21:56,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:56,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:56,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442925302] [2020-02-10 20:21:56,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:56,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:56,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:56,462 INFO L87 Difference]: Start difference. First operand 1580 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:21:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:56,650 INFO L93 Difference]: Finished difference Result 2982 states and 11773 transitions. [2020-02-10 20:21:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:56,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:56,658 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:21:56,658 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:21:56,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:56,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:21:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1575. [2020-02-10 20:21:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:21:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7023 transitions. [2020-02-10 20:21:56,722 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7023 transitions. Word has length 28 [2020-02-10 20:21:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:56,722 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7023 transitions. [2020-02-10 20:21:56,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7023 transitions. [2020-02-10 20:21:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:56,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:56,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:56,724 INFO L427 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:56,725 INFO L82 PathProgramCache]: Analyzing trace with hash 700507876, now seen corresponding path program 711 times [2020-02-10 20:21:56,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:56,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119958162] [2020-02-10 20:21:56,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:57,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119958162] [2020-02-10 20:21:57,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:57,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:57,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369336918] [2020-02-10 20:21:57,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:57,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:57,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:57,262 INFO L87 Difference]: Start difference. First operand 1575 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:21:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:57,406 INFO L93 Difference]: Finished difference Result 2994 states and 11799 transitions. [2020-02-10 20:21:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:57,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:57,413 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 20:21:57,414 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:21:57,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:21:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1583. [2020-02-10 20:21:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:21:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7037 transitions. [2020-02-10 20:21:57,479 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7037 transitions. Word has length 28 [2020-02-10 20:21:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:57,480 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7037 transitions. [2020-02-10 20:21:57,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7037 transitions. [2020-02-10 20:21:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:57,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:57,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:57,482 INFO L427 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:57,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:57,482 INFO L82 PathProgramCache]: Analyzing trace with hash 873755568, now seen corresponding path program 712 times [2020-02-10 20:21:57,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:57,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461950259] [2020-02-10 20:21:57,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:58,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461950259] [2020-02-10 20:21:58,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:58,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:58,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284419765] [2020-02-10 20:21:58,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:58,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:58,018 INFO L87 Difference]: Start difference. First operand 1583 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:21:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:58,250 INFO L93 Difference]: Finished difference Result 2991 states and 11786 transitions. [2020-02-10 20:21:58,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:58,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:58,258 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:21:58,258 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:21:58,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:21:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1575. [2020-02-10 20:21:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:21:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7018 transitions. [2020-02-10 20:21:58,331 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7018 transitions. Word has length 28 [2020-02-10 20:21:58,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:58,331 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7018 transitions. [2020-02-10 20:21:58,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7018 transitions. [2020-02-10 20:21:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:58,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:58,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, 1, 1, 1] [2020-02-10 20:21:58,333 INFO L427 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:58,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1533147108, now seen corresponding path program 713 times [2020-02-10 20:21:58,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:58,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378336708] [2020-02-10 20:21:58,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:58,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378336708] [2020-02-10 20:21:58,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:58,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:58,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774964558] [2020-02-10 20:21:58,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:58,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:58,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:58,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:58,862 INFO L87 Difference]: Start difference. First operand 1575 states and 7018 transitions. Second operand 11 states. [2020-02-10 20:21:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:59,085 INFO L93 Difference]: Finished difference Result 2978 states and 11761 transitions. [2020-02-10 20:21:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:59,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:59,093 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:21:59,093 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:21:59,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:21:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1579. [2020-02-10 20:21:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:21:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7025 transitions. [2020-02-10 20:21:59,159 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7025 transitions. Word has length 28 [2020-02-10 20:21:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:59,159 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7025 transitions. [2020-02-10 20:21:59,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7025 transitions. [2020-02-10 20:21:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:59,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:59,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:59,162 INFO L427 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:59,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:59,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1272415192, now seen corresponding path program 714 times [2020-02-10 20:21:59,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:59,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123293809] [2020-02-10 20:21:59,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:59,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123293809] [2020-02-10 20:21:59,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:59,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:21:59,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602250895] [2020-02-10 20:21:59,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:21:59,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:21:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:59,712 INFO L87 Difference]: Start difference. First operand 1579 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:21:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:59,916 INFO L93 Difference]: Finished difference Result 2981 states and 11763 transitions. [2020-02-10 20:21:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:21:59,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:21:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:59,924 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:21:59,924 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 20:21:59,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:21:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 20:21:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1570. [2020-02-10 20:21:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:21:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7005 transitions. [2020-02-10 20:21:59,989 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7005 transitions. Word has length 28 [2020-02-10 20:21:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:59,990 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7005 transitions. [2020-02-10 20:21:59,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:21:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7005 transitions. [2020-02-10 20:21:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:21:59,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:59,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:59,992 INFO L427 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1766168438, now seen corresponding path program 715 times [2020-02-10 20:21:59,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:59,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768433053] [2020-02-10 20:21:59,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:00,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768433053] [2020-02-10 20:22:00,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:00,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:00,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652285984] [2020-02-10 20:22:00,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:00,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:00,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:00,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:00,528 INFO L87 Difference]: Start difference. First operand 1570 states and 7005 transitions. Second operand 11 states. [2020-02-10 20:22:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:00,703 INFO L93 Difference]: Finished difference Result 2978 states and 11766 transitions. [2020-02-10 20:22:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:00,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:00,710 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:22:00,710 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:22:00,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:22:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1578. [2020-02-10 20:22:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:22:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7027 transitions. [2020-02-10 20:22:00,776 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7027 transitions. Word has length 28 [2020-02-10 20:22:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:00,776 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7027 transitions. [2020-02-10 20:22:00,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7027 transitions. [2020-02-10 20:22:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:00,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:00,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:00,779 INFO L427 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:00,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:00,779 INFO L82 PathProgramCache]: Analyzing trace with hash 467939056, now seen corresponding path program 716 times [2020-02-10 20:22:00,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:00,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72989641] [2020-02-10 20:22:00,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:01,307 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:22:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:01,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72989641] [2020-02-10 20:22:01,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:01,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:01,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881147774] [2020-02-10 20:22:01,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:01,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:01,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:01,315 INFO L87 Difference]: Start difference. First operand 1578 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:22:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:01,530 INFO L93 Difference]: Finished difference Result 2974 states and 11754 transitions. [2020-02-10 20:22:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:01,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:01,537 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:22:01,537 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:22:01,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:22:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1574. [2020-02-10 20:22:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:22:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7016 transitions. [2020-02-10 20:22:01,602 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7016 transitions. Word has length 28 [2020-02-10 20:22:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:01,602 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7016 transitions. [2020-02-10 20:22:01,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7016 transitions. [2020-02-10 20:22:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:01,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:01,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:01,605 INFO L427 AbstractCegarLoop]: === Iteration 725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:01,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:01,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1455713478, now seen corresponding path program 717 times [2020-02-10 20:22:01,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:01,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886689473] [2020-02-10 20:22:01,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:02,125 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:22:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:02,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886689473] [2020-02-10 20:22:02,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:02,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:02,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131806710] [2020-02-10 20:22:02,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:02,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:02,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:02,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:02,133 INFO L87 Difference]: Start difference. First operand 1574 states and 7016 transitions. Second operand 11 states. [2020-02-10 20:22:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:02,344 INFO L93 Difference]: Finished difference Result 2984 states and 11777 transitions. [2020-02-10 20:22:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:02,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:02,352 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:22:02,352 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:22:02,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:22:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1581. [2020-02-10 20:22:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:22:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7029 transitions. [2020-02-10 20:22:02,418 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7029 transitions. Word has length 28 [2020-02-10 20:22:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:02,419 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7029 transitions. [2020-02-10 20:22:02,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7029 transitions. [2020-02-10 20:22:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:02,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:02,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:02,421 INFO L427 AbstractCegarLoop]: === Iteration 726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 884258672, now seen corresponding path program 718 times [2020-02-10 20:22:02,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:02,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134460356] [2020-02-10 20:22:02,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:02,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134460356] [2020-02-10 20:22:02,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:02,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:02,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264769578] [2020-02-10 20:22:02,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:02,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:02,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:02,983 INFO L87 Difference]: Start difference. First operand 1581 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:22:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:03,215 INFO L93 Difference]: Finished difference Result 2983 states and 11768 transitions. [2020-02-10 20:22:03,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:03,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:03,223 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:22:03,223 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:22:03,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:22:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1574. [2020-02-10 20:22:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:22:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7012 transitions. [2020-02-10 20:22:03,288 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7012 transitions. Word has length 28 [2020-02-10 20:22:03,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:03,289 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7012 transitions. [2020-02-10 20:22:03,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7012 transitions. [2020-02-10 20:22:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:03,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:03,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:03,291 INFO L427 AbstractCegarLoop]: === Iteration 727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:03,291 INFO L82 PathProgramCache]: Analyzing trace with hash -67290746, now seen corresponding path program 719 times [2020-02-10 20:22:03,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:03,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045762839] [2020-02-10 20:22:03,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:03,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045762839] [2020-02-10 20:22:03,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:03,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:03,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058943367] [2020-02-10 20:22:03,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:03,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:03,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:03,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:03,823 INFO L87 Difference]: Start difference. First operand 1574 states and 7012 transitions. Second operand 11 states. [2020-02-10 20:22:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:04,052 INFO L93 Difference]: Finished difference Result 2973 states and 11748 transitions. [2020-02-10 20:22:04,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:04,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:04,060 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:22:04,060 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:22:04,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:22:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1578. [2020-02-10 20:22:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:22:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7019 transitions. [2020-02-10 20:22:04,124 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7019 transitions. Word has length 28 [2020-02-10 20:22:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:04,124 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7019 transitions. [2020-02-10 20:22:04,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7019 transitions. [2020-02-10 20:22:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:04,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:04,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:04,126 INFO L427 AbstractCegarLoop]: === Iteration 728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:04,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1422114250, now seen corresponding path program 720 times [2020-02-10 20:22:04,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:04,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182841013] [2020-02-10 20:22:04,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:04,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182841013] [2020-02-10 20:22:04,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:04,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:04,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837764368] [2020-02-10 20:22:04,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:04,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:04,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:04,652 INFO L87 Difference]: Start difference. First operand 1578 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:22:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:04,892 INFO L93 Difference]: Finished difference Result 2976 states and 11750 transitions. [2020-02-10 20:22:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:04,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:04,900 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:22:04,900 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:22:04,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:22:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1545. [2020-02-10 20:22:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2020-02-10 20:22:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 6955 transitions. [2020-02-10 20:22:04,963 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 6955 transitions. Word has length 28 [2020-02-10 20:22:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:04,964 INFO L479 AbstractCegarLoop]: Abstraction has 1545 states and 6955 transitions. [2020-02-10 20:22:04,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 6955 transitions. [2020-02-10 20:22:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:04,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:04,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:04,966 INFO L427 AbstractCegarLoop]: === Iteration 729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:04,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:04,966 INFO L82 PathProgramCache]: Analyzing trace with hash -645301276, now seen corresponding path program 721 times [2020-02-10 20:22:04,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:04,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588585787] [2020-02-10 20:22:04,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:05,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588585787] [2020-02-10 20:22:05,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:05,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:05,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2639820] [2020-02-10 20:22:05,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:05,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:05,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:05,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:05,514 INFO L87 Difference]: Start difference. First operand 1545 states and 6955 transitions. Second operand 11 states. [2020-02-10 20:22:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:05,780 INFO L93 Difference]: Finished difference Result 2968 states and 11774 transitions. [2020-02-10 20:22:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:05,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:05,788 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:22:05,788 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:22:05,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:22:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1581. [2020-02-10 20:22:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:22:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7101 transitions. [2020-02-10 20:22:05,852 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7101 transitions. Word has length 28 [2020-02-10 20:22:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:05,852 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7101 transitions. [2020-02-10 20:22:05,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7101 transitions. [2020-02-10 20:22:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:05,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:05,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:05,855 INFO L427 AbstractCegarLoop]: === Iteration 730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:05,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash 99401222, now seen corresponding path program 722 times [2020-02-10 20:22:05,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:05,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906377692] [2020-02-10 20:22:05,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:06,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906377692] [2020-02-10 20:22:06,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:06,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:06,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833371814] [2020-02-10 20:22:06,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:06,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:06,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:06,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:06,386 INFO L87 Difference]: Start difference. First operand 1581 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:22:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:06,657 INFO L93 Difference]: Finished difference Result 2969 states and 11771 transitions. [2020-02-10 20:22:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:06,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:06,666 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:22:06,666 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:22:06,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:22:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1576. [2020-02-10 20:22:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:22:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7087 transitions. [2020-02-10 20:22:06,732 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7087 transitions. Word has length 28 [2020-02-10 20:22:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:06,732 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7087 transitions. [2020-02-10 20:22:06,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7087 transitions. [2020-02-10 20:22:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:06,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:06,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, 1, 1, 1] [2020-02-10 20:22:06,735 INFO L427 AbstractCegarLoop]: === Iteration 731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:06,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:06,735 INFO L82 PathProgramCache]: Analyzing trace with hash 965639682, now seen corresponding path program 723 times [2020-02-10 20:22:06,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:06,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737189806] [2020-02-10 20:22:06,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:07,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737189806] [2020-02-10 20:22:07,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:07,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:07,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488937622] [2020-02-10 20:22:07,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:07,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:07,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:07,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:07,262 INFO L87 Difference]: Start difference. First operand 1576 states and 7087 transitions. Second operand 11 states. [2020-02-10 20:22:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:07,523 INFO L93 Difference]: Finished difference Result 2973 states and 11778 transitions. [2020-02-10 20:22:07,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:07,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:07,530 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:22:07,530 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:22:07,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:22:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1582. [2020-02-10 20:22:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:22:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7098 transitions. [2020-02-10 20:22:07,596 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7098 transitions. Word has length 28 [2020-02-10 20:22:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:07,596 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7098 transitions. [2020-02-10 20:22:07,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7098 transitions. [2020-02-10 20:22:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:07,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:07,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:07,599 INFO L427 AbstractCegarLoop]: === Iteration 732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:07,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1839922618, now seen corresponding path program 724 times [2020-02-10 20:22:07,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:07,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623198694] [2020-02-10 20:22:07,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:08,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623198694] [2020-02-10 20:22:08,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:08,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:08,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263761975] [2020-02-10 20:22:08,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:08,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:08,132 INFO L87 Difference]: Start difference. First operand 1582 states and 7098 transitions. Second operand 11 states. [2020-02-10 20:22:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:08,299 INFO L93 Difference]: Finished difference Result 2978 states and 11782 transitions. [2020-02-10 20:22:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:08,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:08,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:08,306 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:22:08,306 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:22:08,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:22:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1576. [2020-02-10 20:22:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:22:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7081 transitions. [2020-02-10 20:22:08,370 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7081 transitions. Word has length 28 [2020-02-10 20:22:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:08,370 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7081 transitions. [2020-02-10 20:22:08,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7081 transitions. [2020-02-10 20:22:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:08,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:08,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:08,372 INFO L427 AbstractCegarLoop]: === Iteration 733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash -973684158, now seen corresponding path program 725 times [2020-02-10 20:22:08,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:08,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467849085] [2020-02-10 20:22:08,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:08,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-02-10 20:22:08,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467849085] [2020-02-10 20:22:08,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:08,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:08,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506675334] [2020-02-10 20:22:08,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:08,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:08,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:08,917 INFO L87 Difference]: Start difference. First operand 1576 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:22:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:09,108 INFO L93 Difference]: Finished difference Result 2976 states and 11779 transitions. [2020-02-10 20:22:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:09,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:09,115 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:22:09,115 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:22:09,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:22:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1583. [2020-02-10 20:22:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:22:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7094 transitions. [2020-02-10 20:22:09,180 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7094 transitions. Word has length 28 [2020-02-10 20:22:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:09,181 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7094 transitions. [2020-02-10 20:22:09,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7094 transitions. [2020-02-10 20:22:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:09,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:09,183 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:09,183 INFO L427 AbstractCegarLoop]: === Iteration 734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:09,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:09,183 INFO L82 PathProgramCache]: Analyzing trace with hash -228981660, now seen corresponding path program 726 times [2020-02-10 20:22:09,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:09,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314452856] [2020-02-10 20:22:09,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:09,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314452856] [2020-02-10 20:22:09,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:09,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:09,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752253979] [2020-02-10 20:22:09,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:09,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:09,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:09,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:09,745 INFO L87 Difference]: Start difference. First operand 1583 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:22:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:09,982 INFO L93 Difference]: Finished difference Result 2980 states and 11780 transitions. [2020-02-10 20:22:09,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:09,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:09,989 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:22:09,989 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:22:09,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:22:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1570. [2020-02-10 20:22:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:22:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7064 transitions. [2020-02-10 20:22:10,052 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7064 transitions. Word has length 28 [2020-02-10 20:22:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:10,053 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7064 transitions. [2020-02-10 20:22:10,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7064 transitions. [2020-02-10 20:22:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:10,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:10,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, 1, 1, 1] [2020-02-10 20:22:10,055 INFO L427 AbstractCegarLoop]: === Iteration 735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:10,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:10,055 INFO L82 PathProgramCache]: Analyzing trace with hash 74711198, now seen corresponding path program 727 times [2020-02-10 20:22:10,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:10,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912973309] [2020-02-10 20:22:10,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:10,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912973309] [2020-02-10 20:22:10,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:10,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:10,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335170210] [2020-02-10 20:22:10,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:10,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:10,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:10,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:10,588 INFO L87 Difference]: Start difference. First operand 1570 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:22:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:10,781 INFO L93 Difference]: Finished difference Result 2963 states and 11758 transitions. [2020-02-10 20:22:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:10,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:10,789 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:22:10,789 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:22:10,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:22:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1580. [2020-02-10 20:22:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:22:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7092 transitions. [2020-02-10 20:22:10,854 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7092 transitions. Word has length 28 [2020-02-10 20:22:10,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:10,855 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7092 transitions. [2020-02-10 20:22:10,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:10,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7092 transitions. [2020-02-10 20:22:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:10,857 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:10,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:10,857 INFO L427 AbstractCegarLoop]: === Iteration 736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:10,857 INFO L82 PathProgramCache]: Analyzing trace with hash 819413696, now seen corresponding path program 728 times [2020-02-10 20:22:10,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:10,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946421844] [2020-02-10 20:22:10,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:11,293 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:22:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:11,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946421844] [2020-02-10 20:22:11,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:11,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:11,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900381313] [2020-02-10 20:22:11,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:11,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:11,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:11,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:11,413 INFO L87 Difference]: Start difference. First operand 1580 states and 7092 transitions. Second operand 11 states. [2020-02-10 20:22:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:11,675 INFO L93 Difference]: Finished difference Result 2964 states and 11755 transitions. [2020-02-10 20:22:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:11,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:11,682 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:22:11,682 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:22:11,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:22:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1575. [2020-02-10 20:22:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:22:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7078 transitions. [2020-02-10 20:22:11,748 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7078 transitions. Word has length 28 [2020-02-10 20:22:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:11,748 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7078 transitions. [2020-02-10 20:22:11,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7078 transitions. [2020-02-10 20:22:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:11,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:11,750 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:11,750 INFO L427 AbstractCegarLoop]: === Iteration 737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:11,751 INFO L82 PathProgramCache]: Analyzing trace with hash -998374182, now seen corresponding path program 729 times [2020-02-10 20:22:11,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:11,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364662108] [2020-02-10 20:22:11,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:12,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364662108] [2020-02-10 20:22:12,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:12,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:12,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609124801] [2020-02-10 20:22:12,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:12,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:12,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:12,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:12,280 INFO L87 Difference]: Start difference. First operand 1575 states and 7078 transitions. Second operand 11 states. [2020-02-10 20:22:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:12,541 INFO L93 Difference]: Finished difference Result 2965 states and 11757 transitions. [2020-02-10 20:22:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:12,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:12,549 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:22:12,549 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:22:12,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:22:12,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1580. [2020-02-10 20:22:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:22:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7087 transitions. [2020-02-10 20:22:12,615 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7087 transitions. Word has length 28 [2020-02-10 20:22:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:12,615 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7087 transitions. [2020-02-10 20:22:12,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7087 transitions. [2020-02-10 20:22:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:12,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:12,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:12,618 INFO L427 AbstractCegarLoop]: === Iteration 738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:12,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:12,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1235733312, now seen corresponding path program 730 times [2020-02-10 20:22:12,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:12,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750841769] [2020-02-10 20:22:12,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:13,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750841769] [2020-02-10 20:22:13,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:13,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:13,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600444927] [2020-02-10 20:22:13,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:13,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:13,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:13,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:13,141 INFO L87 Difference]: Start difference. First operand 1580 states and 7087 transitions. Second operand 11 states. [2020-02-10 20:22:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:13,342 INFO L93 Difference]: Finished difference Result 2968 states and 11758 transitions. [2020-02-10 20:22:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:13,343 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:13,351 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:22:13,351 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:22:13,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:22:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1575. [2020-02-10 20:22:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:22:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7073 transitions. [2020-02-10 20:22:13,416 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7073 transitions. Word has length 28 [2020-02-10 20:22:13,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:13,416 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7073 transitions. [2020-02-10 20:22:13,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7073 transitions. [2020-02-10 20:22:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:13,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:13,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:13,419 INFO L427 AbstractCegarLoop]: === Iteration 739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:13,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1357269274, now seen corresponding path program 731 times [2020-02-10 20:22:13,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:13,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357081110] [2020-02-10 20:22:13,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:13,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357081110] [2020-02-10 20:22:13,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:13,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:13,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555994698] [2020-02-10 20:22:13,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:13,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:13,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:13,947 INFO L87 Difference]: Start difference. First operand 1575 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:22:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:14,204 INFO L93 Difference]: Finished difference Result 2968 states and 11759 transitions. [2020-02-10 20:22:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:14,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:14,211 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:22:14,212 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:22:14,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:22:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1581. [2020-02-10 20:22:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:22:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7084 transitions. [2020-02-10 20:22:14,278 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7084 transitions. Word has length 28 [2020-02-10 20:22:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:14,278 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7084 transitions. [2020-02-10 20:22:14,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7084 transitions. [2020-02-10 20:22:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:14,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:14,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:14,280 INFO L427 AbstractCegarLoop]: === Iteration 740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:14,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:14,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1448293026, now seen corresponding path program 732 times [2020-02-10 20:22:14,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:14,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644463039] [2020-02-10 20:22:14,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:14,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644463039] [2020-02-10 20:22:14,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:14,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:14,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987890869] [2020-02-10 20:22:14,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:14,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:14,806 INFO L87 Difference]: Start difference. First operand 1581 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:22:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:14,980 INFO L93 Difference]: Finished difference Result 2970 states and 11757 transitions. [2020-02-10 20:22:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:14,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:14,987 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:22:14,988 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:22:14,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:22:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1570. [2020-02-10 20:22:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:22:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7059 transitions. [2020-02-10 20:22:15,051 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7059 transitions. Word has length 28 [2020-02-10 20:22:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:15,052 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7059 transitions. [2020-02-10 20:22:15,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7059 transitions. [2020-02-10 20:22:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:15,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:15,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:15,054 INFO L427 AbstractCegarLoop]: === Iteration 741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:15,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:15,054 INFO L82 PathProgramCache]: Analyzing trace with hash 85214302, now seen corresponding path program 733 times [2020-02-10 20:22:15,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:15,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920872069] [2020-02-10 20:22:15,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:15,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920872069] [2020-02-10 20:22:15,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:15,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:15,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509356779] [2020-02-10 20:22:15,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:15,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:15,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:15,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:15,574 INFO L87 Difference]: Start difference. First operand 1570 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:22:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:15,764 INFO L93 Difference]: Finished difference Result 2979 states and 11785 transitions. [2020-02-10 20:22:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:15,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:15,772 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:22:15,772 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:22:15,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:15,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:22:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1583. [2020-02-10 20:22:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:22:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7094 transitions. [2020-02-10 20:22:15,836 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7094 transitions. Word has length 28 [2020-02-10 20:22:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:15,837 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7094 transitions. [2020-02-10 20:22:15,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7094 transitions. [2020-02-10 20:22:15,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:15,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:15,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:15,839 INFO L427 AbstractCegarLoop]: === Iteration 742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:15,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:15,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1574619298, now seen corresponding path program 734 times [2020-02-10 20:22:15,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:15,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595320933] [2020-02-10 20:22:15,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:16,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595320933] [2020-02-10 20:22:16,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:16,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:16,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936177682] [2020-02-10 20:22:16,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:16,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:16,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:16,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:16,368 INFO L87 Difference]: Start difference. First operand 1583 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:22:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:16,497 INFO L93 Difference]: Finished difference Result 2984 states and 11789 transitions. [2020-02-10 20:22:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:16,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:16,504 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:22:16,505 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:22:16,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:16,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:22:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1577. [2020-02-10 20:22:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:22:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7077 transitions. [2020-02-10 20:22:16,572 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7077 transitions. Word has length 28 [2020-02-10 20:22:16,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:16,572 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7077 transitions. [2020-02-10 20:22:16,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7077 transitions. [2020-02-10 20:22:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:16,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:16,575 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:16,575 INFO L427 AbstractCegarLoop]: === Iteration 743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1696155260, now seen corresponding path program 735 times [2020-02-10 20:22:16,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:16,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10365557] [2020-02-10 20:22:16,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:17,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10365557] [2020-02-10 20:22:17,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:17,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:17,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804253157] [2020-02-10 20:22:17,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:17,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:17,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:17,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:17,115 INFO L87 Difference]: Start difference. First operand 1577 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:22:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:17,307 INFO L93 Difference]: Finished difference Result 2976 states and 11774 transitions. [2020-02-10 20:22:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:17,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:17,315 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:22:17,315 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:22:17,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:22:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1582. [2020-02-10 20:22:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:22:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7086 transitions. [2020-02-10 20:22:17,379 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7086 transitions. Word has length 28 [2020-02-10 20:22:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:17,380 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7086 transitions. [2020-02-10 20:22:17,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7086 transitions. [2020-02-10 20:22:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:17,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:17,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:17,382 INFO L427 AbstractCegarLoop]: === Iteration 744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash -364704542, now seen corresponding path program 736 times [2020-02-10 20:22:17,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:17,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428919434] [2020-02-10 20:22:17,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:17,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428919434] [2020-02-10 20:22:17,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:17,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:17,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347840910] [2020-02-10 20:22:17,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:17,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:17,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:17,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:17,910 INFO L87 Difference]: Start difference. First operand 1582 states and 7086 transitions. Second operand 11 states. [2020-02-10 20:22:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:18,081 INFO L93 Difference]: Finished difference Result 2979 states and 11775 transitions. [2020-02-10 20:22:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:18,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:18,089 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:22:18,089 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:22:18,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:22:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1577. [2020-02-10 20:22:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:22:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7072 transitions. [2020-02-10 20:22:18,154 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7072 transitions. Word has length 28 [2020-02-10 20:22:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:18,154 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7072 transitions. [2020-02-10 20:22:18,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7072 transitions. [2020-02-10 20:22:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:18,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:18,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:18,157 INFO L427 AbstractCegarLoop]: === Iteration 745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:18,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:18,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2112474876, now seen corresponding path program 737 times [2020-02-10 20:22:18,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:18,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832488275] [2020-02-10 20:22:18,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:18,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832488275] [2020-02-10 20:22:18,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:18,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:18,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825232592] [2020-02-10 20:22:18,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:18,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:18,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:18,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:18,700 INFO L87 Difference]: Start difference. First operand 1577 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:22:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:18,854 INFO L93 Difference]: Finished difference Result 2991 states and 11799 transitions. [2020-02-10 20:22:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:18,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:18,862 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:22:18,863 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:22:18,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:22:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1587. [2020-02-10 20:22:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:22:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7089 transitions. [2020-02-10 20:22:18,928 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7089 transitions. Word has length 28 [2020-02-10 20:22:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:18,928 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7089 transitions. [2020-02-10 20:22:18,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7089 transitions. [2020-02-10 20:22:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:18,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:18,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:18,931 INFO L427 AbstractCegarLoop]: === Iteration 746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:18,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1437789922, now seen corresponding path program 738 times [2020-02-10 20:22:18,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:18,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023221043] [2020-02-10 20:22:18,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:19,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023221043] [2020-02-10 20:22:19,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:19,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:19,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218325833] [2020-02-10 20:22:19,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:19,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:19,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:19,461 INFO L87 Difference]: Start difference. First operand 1587 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:22:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:19,645 INFO L93 Difference]: Finished difference Result 2989 states and 11787 transitions. [2020-02-10 20:22:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:19,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:19,652 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:22:19,653 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:22:19,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:22:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1570. [2020-02-10 20:22:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:22:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 20:22:19,717 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 20:22:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:19,718 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 20:22:19,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 20:22:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:19,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:19,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:19,720 INFO L427 AbstractCegarLoop]: === Iteration 747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash 840419904, now seen corresponding path program 739 times [2020-02-10 20:22:19,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:19,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087111101] [2020-02-10 20:22:19,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22: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-02-10 20:22:20,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087111101] [2020-02-10 20:22:20,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:20,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:20,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229818598] [2020-02-10 20:22:20,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:20,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:20,255 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:22:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:20,449 INFO L93 Difference]: Finished difference Result 2986 states and 11797 transitions. [2020-02-10 20:22:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:20,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:20,457 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:22:20,457 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:22:20,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:22:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1585. [2020-02-10 20:22:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:22:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7093 transitions. [2020-02-10 20:22:20,522 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7093 transitions. Word has length 28 [2020-02-10 20:22:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:20,522 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7093 transitions. [2020-02-10 20:22:20,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7093 transitions. [2020-02-10 20:22:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:20,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:20,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:20,524 INFO L427 AbstractCegarLoop]: === Iteration 748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:20,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1585122402, now seen corresponding path program 740 times [2020-02-10 20:22:20,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:20,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887062334] [2020-02-10 20:22:20,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:21,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887062334] [2020-02-10 20:22:21,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:21,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:21,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994334062] [2020-02-10 20:22:21,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:21,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:21,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:21,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:21,065 INFO L87 Difference]: Start difference. First operand 1585 states and 7093 transitions. Second operand 11 states. [2020-02-10 20:22:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:21,196 INFO L93 Difference]: Finished difference Result 2990 states and 11798 transitions. [2020-02-10 20:22:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:21,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:21,204 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:22:21,205 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:22:21,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:22:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1578. [2020-02-10 20:22:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:22:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 20:22:21,270 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 20:22:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:21,270 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 20:22:21,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 20:22:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:21,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:21,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:21,273 INFO L427 AbstractCegarLoop]: === Iteration 749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:21,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1843606434, now seen corresponding path program 741 times [2020-02-10 20:22:21,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:21,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553818436] [2020-02-10 20:22:21,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:21,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553818436] [2020-02-10 20:22:21,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:21,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:21,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20518966] [2020-02-10 20:22:21,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:21,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:21,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:21,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:21,806 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:22:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:21,974 INFO L93 Difference]: Finished difference Result 2983 states and 11785 transitions. [2020-02-10 20:22:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:21,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:21,982 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:22:21,982 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 20:22:21,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 20:22:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1584. [2020-02-10 20:22:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:22:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7084 transitions. [2020-02-10 20:22:22,046 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7084 transitions. Word has length 28 [2020-02-10 20:22:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:22,047 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7084 transitions. [2020-02-10 20:22:22,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7084 transitions. [2020-02-10 20:22:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:22,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:22,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:22,049 INFO L427 AbstractCegarLoop]: === Iteration 750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:22,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:22,049 INFO L82 PathProgramCache]: Analyzing trace with hash -354201438, now seen corresponding path program 742 times [2020-02-10 20:22:22,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:22,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506537389] [2020-02-10 20:22:22,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:22,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506537389] [2020-02-10 20:22:22,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:22,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:22,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567570703] [2020-02-10 20:22:22,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:22,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:22,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:22,594 INFO L87 Difference]: Start difference. First operand 1584 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:22:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:22,770 INFO L93 Difference]: Finished difference Result 2985 states and 11783 transitions. [2020-02-10 20:22:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:22,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:22,778 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:22:22,778 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:22:22,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:22:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1578. [2020-02-10 20:22:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:22:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7067 transitions. [2020-02-10 20:22:22,844 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7067 transitions. Word has length 28 [2020-02-10 20:22:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:22,844 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7067 transitions. [2020-02-10 20:22:22,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7067 transitions. [2020-02-10 20:22:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:22,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:22,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:22,847 INFO L427 AbstractCegarLoop]: === Iteration 751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash 512037022, now seen corresponding path program 743 times [2020-02-10 20:22:22,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:22,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351542401] [2020-02-10 20:22:22,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:23,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351542401] [2020-02-10 20:22:23,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:23,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:23,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895701162] [2020-02-10 20:22:23,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:23,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:23,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:23,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:23,416 INFO L87 Difference]: Start difference. First operand 1578 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:22:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:23,556 INFO L93 Difference]: Finished difference Result 2995 states and 11802 transitions. [2020-02-10 20:22:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:23,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:23,564 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:22:23,565 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:22:23,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:22:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1588. [2020-02-10 20:22:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:22:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7084 transitions. [2020-02-10 20:22:23,630 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7084 transitions. Word has length 28 [2020-02-10 20:22:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:23,630 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7084 transitions. [2020-02-10 20:22:23,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7084 transitions. [2020-02-10 20:22:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:23,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:23,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:23,633 INFO L427 AbstractCegarLoop]: === Iteration 752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1256739520, now seen corresponding path program 744 times [2020-02-10 20:22:23,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:23,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119425283] [2020-02-10 20:22:23,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:24,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119425283] [2020-02-10 20:22:24,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:24,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:24,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202073142] [2020-02-10 20:22:24,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:24,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:24,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:24,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:24,173 INFO L87 Difference]: Start difference. First operand 1588 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:22:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:24,358 INFO L93 Difference]: Finished difference Result 2993 states and 11790 transitions. [2020-02-10 20:22:24,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:24,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:24,366 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:22:24,366 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:22:24,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:22:24,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1563. [2020-02-10 20:22:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:22:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7032 transitions. [2020-02-10 20:22:24,429 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7032 transitions. Word has length 28 [2020-02-10 20:22:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:24,429 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7032 transitions. [2020-02-10 20:22:24,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7032 transitions. [2020-02-10 20:22:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:24,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:24,432 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:24,432 INFO L427 AbstractCegarLoop]: === Iteration 753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:24,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash -725043348, now seen corresponding path program 745 times [2020-02-10 20:22:24,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:24,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985405761] [2020-02-10 20:22:24,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:24,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985405761] [2020-02-10 20:22:24,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:24,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:24,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926920135] [2020-02-10 20:22:24,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:24,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:24,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:24,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:24,958 INFO L87 Difference]: Start difference. First operand 1563 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:22:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:25,158 INFO L93 Difference]: Finished difference Result 2962 states and 11754 transitions. [2020-02-10 20:22:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:25,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:25,166 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:22:25,166 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:22:25,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:22:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1580. [2020-02-10 20:22:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:22:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7091 transitions. [2020-02-10 20:22:25,230 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7091 transitions. Word has length 28 [2020-02-10 20:22:25,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:25,230 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7091 transitions. [2020-02-10 20:22:25,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7091 transitions. [2020-02-10 20:22:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:25,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:25,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:25,233 INFO L427 AbstractCegarLoop]: === Iteration 754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:25,233 INFO L82 PathProgramCache]: Analyzing trace with hash 19659150, now seen corresponding path program 746 times [2020-02-10 20:22:25,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:25,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918134193] [2020-02-10 20:22:25,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:25,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918134193] [2020-02-10 20:22:25,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:25,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:25,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278186236] [2020-02-10 20:22:25,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:25,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:25,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:25,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:25,762 INFO L87 Difference]: Start difference. First operand 1580 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:22:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:25,937 INFO L93 Difference]: Finished difference Result 2963 states and 11751 transitions. [2020-02-10 20:22:25,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:25,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:25,944 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:22:25,944 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:22:25,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:22:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1575. [2020-02-10 20:22:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:22:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7077 transitions. [2020-02-10 20:22:26,007 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7077 transitions. Word has length 28 [2020-02-10 20:22:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:26,008 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7077 transitions. [2020-02-10 20:22:26,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7077 transitions. [2020-02-10 20:22:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:26,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:26,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:26,010 INFO L427 AbstractCegarLoop]: === Iteration 755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:26,010 INFO L82 PathProgramCache]: Analyzing trace with hash 885897610, now seen corresponding path program 747 times [2020-02-10 20:22:26,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:26,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613499331] [2020-02-10 20:22:26,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:26,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613499331] [2020-02-10 20:22:26,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:26,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:26,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131968725] [2020-02-10 20:22:26,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:26,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:26,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:26,534 INFO L87 Difference]: Start difference. First operand 1575 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:22:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:26,715 INFO L93 Difference]: Finished difference Result 2967 states and 11758 transitions. [2020-02-10 20:22:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:26,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:26,723 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:22:26,723 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:22:26,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:22:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1581. [2020-02-10 20:22:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:22:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7088 transitions. [2020-02-10 20:22:26,789 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7088 transitions. Word has length 28 [2020-02-10 20:22:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:26,790 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7088 transitions. [2020-02-10 20:22:26,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7088 transitions. [2020-02-10 20:22:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:26,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:26,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:26,792 INFO L427 AbstractCegarLoop]: === Iteration 756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:26,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:26,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1919664690, now seen corresponding path program 748 times [2020-02-10 20:22:26,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:26,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822345573] [2020-02-10 20:22:26,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:27,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822345573] [2020-02-10 20:22:27,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:27,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:27,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674180001] [2020-02-10 20:22:27,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:27,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:27,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:27,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:27,328 INFO L87 Difference]: Start difference. First operand 1581 states and 7088 transitions. Second operand 11 states. [2020-02-10 20:22:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:27,474 INFO L93 Difference]: Finished difference Result 2972 states and 11762 transitions. [2020-02-10 20:22:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:27,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:27,481 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:22:27,481 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:22:27,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:22:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1575. [2020-02-10 20:22:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:22:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 20:22:27,547 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 20:22:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:27,547 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 20:22:27,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 20:22:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:27,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:27,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:27,550 INFO L427 AbstractCegarLoop]: === Iteration 757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:27,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:27,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1053426230, now seen corresponding path program 749 times [2020-02-10 20:22:27,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:27,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638562465] [2020-02-10 20:22:27,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:28,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638562465] [2020-02-10 20:22:28,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:28,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:28,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892344224] [2020-02-10 20:22:28,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:28,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:28,082 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:22:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:28,256 INFO L93 Difference]: Finished difference Result 2970 states and 11759 transitions. [2020-02-10 20:22:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:28,256 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:28,263 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:22:28,263 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:22:28,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:22:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1582. [2020-02-10 20:22:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:22:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7084 transitions. [2020-02-10 20:22:28,329 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7084 transitions. Word has length 28 [2020-02-10 20:22:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:28,329 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7084 transitions. [2020-02-10 20:22:28,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7084 transitions. [2020-02-10 20:22:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:28,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:28,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:28,332 INFO L427 AbstractCegarLoop]: === Iteration 758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:28,332 INFO L82 PathProgramCache]: Analyzing trace with hash -308723732, now seen corresponding path program 750 times [2020-02-10 20:22:28,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:28,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308002047] [2020-02-10 20:22:28,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:28,886 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:22:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:28,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308002047] [2020-02-10 20:22:28,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:28,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:28,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740737038] [2020-02-10 20:22:28,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:28,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:28,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:28,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:28,894 INFO L87 Difference]: Start difference. First operand 1582 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:22:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:29,065 INFO L93 Difference]: Finished difference Result 2974 states and 11760 transitions. [2020-02-10 20:22:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:29,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:29,073 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:22:29,073 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:22:29,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:22:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1569. [2020-02-10 20:22:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:22:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7054 transitions. [2020-02-10 20:22:29,139 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7054 transitions. Word has length 28 [2020-02-10 20:22:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:29,139 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7054 transitions. [2020-02-10 20:22:29,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7054 transitions. [2020-02-10 20:22:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:29,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:29,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:29,142 INFO L427 AbstractCegarLoop]: === Iteration 759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:29,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1550256474, now seen corresponding path program 751 times [2020-02-10 20:22:29,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:29,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126940423] [2020-02-10 20:22:29,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:29,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126940423] [2020-02-10 20:22:29,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:29,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:29,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091057139] [2020-02-10 20:22:29,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:29,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:29,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:29,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:29,661 INFO L87 Difference]: Start difference. First operand 1569 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:22:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:29,834 INFO L93 Difference]: Finished difference Result 2956 states and 11736 transitions. [2020-02-10 20:22:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:29,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:29,842 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:22:29,842 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:22:29,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:22:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1579. [2020-02-10 20:22:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:22:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7082 transitions. [2020-02-10 20:22:29,908 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7082 transitions. Word has length 28 [2020-02-10 20:22:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:29,908 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7082 transitions. [2020-02-10 20:22:29,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7082 transitions. [2020-02-10 20:22:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:29,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:29,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:29,911 INFO L427 AbstractCegarLoop]: === Iteration 760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:29,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:29,911 INFO L82 PathProgramCache]: Analyzing trace with hash -805553976, now seen corresponding path program 752 times [2020-02-10 20:22:29,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:29,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108249503] [2020-02-10 20:22:29,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:30,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108249503] [2020-02-10 20:22:30,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:30,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:30,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284153315] [2020-02-10 20:22:30,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:30,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:30,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:30,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:30,446 INFO L87 Difference]: Start difference. First operand 1579 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:22:30,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:30,616 INFO L93 Difference]: Finished difference Result 2957 states and 11733 transitions. [2020-02-10 20:22:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:30,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:30,624 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:22:30,624 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:22:30,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:22:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1574. [2020-02-10 20:22:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:22:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7068 transitions. [2020-02-10 20:22:30,687 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7068 transitions. Word has length 28 [2020-02-10 20:22:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:30,688 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7068 transitions. [2020-02-10 20:22:30,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7068 transitions. [2020-02-10 20:22:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:30,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:30,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:30,690 INFO L427 AbstractCegarLoop]: === Iteration 761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:30,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:30,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1136395640, now seen corresponding path program 753 times [2020-02-10 20:22:30,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:30,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789508749] [2020-02-10 20:22:30,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:31,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789508749] [2020-02-10 20:22:31,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:31,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:31,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966200064] [2020-02-10 20:22:31,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:31,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:31,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:31,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:31,226 INFO L87 Difference]: Start difference. First operand 1574 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:22:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:31,449 INFO L93 Difference]: Finished difference Result 2957 states and 11733 transitions. [2020-02-10 20:22:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:31,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:31,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:31,458 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:22:31,458 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:22:31,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:22:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1579. [2020-02-10 20:22:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:22:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7077 transitions. [2020-02-10 20:22:31,521 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7077 transitions. Word has length 28 [2020-02-10 20:22:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:31,522 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7077 transitions. [2020-02-10 20:22:31,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7077 transitions. [2020-02-10 20:22:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:31,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:31,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:31,524 INFO L427 AbstractCegarLoop]: === Iteration 762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1495918968, now seen corresponding path program 754 times [2020-02-10 20:22:31,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:31,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733454410] [2020-02-10 20:22:31,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:32,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733454410] [2020-02-10 20:22:32,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:32,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:32,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719523370] [2020-02-10 20:22:32,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:32,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:32,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:32,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:32,064 INFO L87 Difference]: Start difference. First operand 1579 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:22:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:32,288 INFO L93 Difference]: Finished difference Result 2959 states and 11732 transitions. [2020-02-10 20:22:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:32,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:32,296 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:22:32,296 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:22:32,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:22:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1574. [2020-02-10 20:22:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:22:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7063 transitions. [2020-02-10 20:22:32,361 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7063 transitions. Word has length 28 [2020-02-10 20:22:32,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:32,361 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7063 transitions. [2020-02-10 20:22:32,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7063 transitions. [2020-02-10 20:22:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:32,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:32,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:32,363 INFO L427 AbstractCegarLoop]: === Iteration 763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:32,364 INFO L82 PathProgramCache]: Analyzing trace with hash -802928200, now seen corresponding path program 755 times [2020-02-10 20:22:32,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:32,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9054748] [2020-02-10 20:22:32,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:32,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9054748] [2020-02-10 20:22:32,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:32,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:32,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721789181] [2020-02-10 20:22:32,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:32,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:32,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:32,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:32,899 INFO L87 Difference]: Start difference. First operand 1574 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:22:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:33,072 INFO L93 Difference]: Finished difference Result 2960 states and 11735 transitions. [2020-02-10 20:22:33,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:33,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:33,080 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 20:22:33,080 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:22:33,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:22:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1580. [2020-02-10 20:22:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:22:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7074 transitions. [2020-02-10 20:22:33,144 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7074 transitions. Word has length 28 [2020-02-10 20:22:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:33,145 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7074 transitions. [2020-02-10 20:22:33,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7074 transitions. [2020-02-10 20:22:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:33,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:33,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:33,147 INFO L427 AbstractCegarLoop]: === Iteration 764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:33,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:33,147 INFO L82 PathProgramCache]: Analyzing trace with hash 115021990, now seen corresponding path program 756 times [2020-02-10 20:22:33,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:33,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442288483] [2020-02-10 20:22:33,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:33,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442288483] [2020-02-10 20:22:33,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:33,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:33,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405911360] [2020-02-10 20:22:33,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:33,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:33,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:33,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:33,684 INFO L87 Difference]: Start difference. First operand 1580 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:22:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:33,863 INFO L93 Difference]: Finished difference Result 2961 states and 11731 transitions. [2020-02-10 20:22:33,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:33,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:33,871 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:22:33,871 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:22:33,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:22:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1569. [2020-02-10 20:22:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:22:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7049 transitions. [2020-02-10 20:22:33,937 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7049 transitions. Word has length 28 [2020-02-10 20:22:33,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:33,937 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7049 transitions. [2020-02-10 20:22:33,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:33,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7049 transitions. [2020-02-10 20:22:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:33,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:33,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:33,940 INFO L427 AbstractCegarLoop]: === Iteration 765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1539753370, now seen corresponding path program 757 times [2020-02-10 20:22:33,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:33,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316211239] [2020-02-10 20:22:33,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:34,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316211239] [2020-02-10 20:22:34,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:34,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:34,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60109104] [2020-02-10 20:22:34,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:34,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:34,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:34,499 INFO L87 Difference]: Start difference. First operand 1569 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:22:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:34,672 INFO L93 Difference]: Finished difference Result 2969 states and 11757 transitions. [2020-02-10 20:22:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:34,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:34,680 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:22:34,680 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:22:34,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:22:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1581. [2020-02-10 20:22:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:22:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7082 transitions. [2020-02-10 20:22:34,764 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7082 transitions. Word has length 28 [2020-02-10 20:22:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:34,764 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7082 transitions. [2020-02-10 20:22:34,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7082 transitions. [2020-02-10 20:22:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:34,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:34,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:34,767 INFO L427 AbstractCegarLoop]: === Iteration 766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:34,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash -50348374, now seen corresponding path program 758 times [2020-02-10 20:22:34,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:34,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612902570] [2020-02-10 20:22:34,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:35,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612902570] [2020-02-10 20:22:35,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:35,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:35,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717793723] [2020-02-10 20:22:35,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:35,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:35,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:35,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:35,291 INFO L87 Difference]: Start difference. First operand 1581 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:22:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:35,436 INFO L93 Difference]: Finished difference Result 2974 states and 11761 transitions. [2020-02-10 20:22:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:35,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:35,443 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:22:35,443 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:22:35,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:22:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1575. [2020-02-10 20:22:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:22:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7065 transitions. [2020-02-10 20:22:35,508 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7065 transitions. Word has length 28 [2020-02-10 20:22:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:35,508 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7065 transitions. [2020-02-10 20:22:35,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7065 transitions. [2020-02-10 20:22:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:35,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22: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, 1, 1, 1] [2020-02-10 20:22:35,511 INFO L427 AbstractCegarLoop]: === Iteration 767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:35,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash -464042214, now seen corresponding path program 759 times [2020-02-10 20:22:35,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:35,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748010480] [2020-02-10 20:22:35,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:36,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-02-10 20:22:36,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748010480] [2020-02-10 20:22:36,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:36,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:36,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821343164] [2020-02-10 20:22:36,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:36,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:36,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:36,028 INFO L87 Difference]: Start difference. First operand 1575 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:22:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:36,198 INFO L93 Difference]: Finished difference Result 2965 states and 11744 transitions. [2020-02-10 20:22:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:36,199 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:36,206 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:22:36,206 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:22:36,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:22:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1580. [2020-02-10 20:22:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:22:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7074 transitions. [2020-02-10 20:22:36,270 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7074 transitions. Word has length 28 [2020-02-10 20:22:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:36,270 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7074 transitions. [2020-02-10 20:22:36,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7074 transitions. [2020-02-10 20:22:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:36,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:36,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:36,272 INFO L427 AbstractCegarLoop]: === Iteration 768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1198610474, now seen corresponding path program 760 times [2020-02-10 20:22:36,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:36,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10700511] [2020-02-10 20:22:36,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:36,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10700511] [2020-02-10 20:22:36,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:36,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:36,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655855793] [2020-02-10 20:22:36,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:36,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:36,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:36,801 INFO L87 Difference]: Start difference. First operand 1580 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:22:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:37,023 INFO L93 Difference]: Finished difference Result 2967 states and 11743 transitions. [2020-02-10 20:22:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:37,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:37,030 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:22:37,031 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:22:37,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:22:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1575. [2020-02-10 20:22:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:22:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7060 transitions. [2020-02-10 20:22:37,096 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7060 transitions. Word has length 28 [2020-02-10 20:22:37,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:37,096 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7060 transitions. [2020-02-10 20:22:37,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7060 transitions. [2020-02-10 20:22:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:37,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22: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, 1, 1, 1] [2020-02-10 20:22:37,099 INFO L427 AbstractCegarLoop]: === Iteration 769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash -47722598, now seen corresponding path program 761 times [2020-02-10 20:22:37,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:37,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104165155] [2020-02-10 20:22:37,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:37,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104165155] [2020-02-10 20:22:37,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:37,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:37,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789844920] [2020-02-10 20:22:37,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:37,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:37,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:37,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:37,628 INFO L87 Difference]: Start difference. First operand 1575 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:22:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:37,787 INFO L93 Difference]: Finished difference Result 2978 states and 11765 transitions. [2020-02-10 20:22:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:37,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:37,795 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:22:37,795 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:22:37,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:22:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1583. [2020-02-10 20:22:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:22:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7074 transitions. [2020-02-10 20:22:37,859 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7074 transitions. Word has length 28 [2020-02-10 20:22:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:37,859 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7074 transitions. [2020-02-10 20:22:37,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7074 transitions. [2020-02-10 20:22:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:37,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:37,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:37,861 INFO L427 AbstractCegarLoop]: === Iteration 770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:37,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:37,861 INFO L82 PathProgramCache]: Analyzing trace with hash 125525094, now seen corresponding path program 762 times [2020-02-10 20:22:37,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:37,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210547710] [2020-02-10 20:22:37,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:38,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210547710] [2020-02-10 20:22:38,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:38,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:38,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576300013] [2020-02-10 20:22:38,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:38,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:38,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:38,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:38,393 INFO L87 Difference]: Start difference. First operand 1583 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:22:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:38,592 INFO L93 Difference]: Finished difference Result 2975 states and 11752 transitions. [2020-02-10 20:22:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:38,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:38,600 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 20:22:38,600 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:22:38,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:22:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1569. [2020-02-10 20:22:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:22:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7043 transitions. [2020-02-10 20:22:38,664 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7043 transitions. Word has length 28 [2020-02-10 20:22:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:38,664 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7043 transitions. [2020-02-10 20:22:38,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7043 transitions. [2020-02-10 20:22:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:38,666 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:38,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:38,667 INFO L427 AbstractCegarLoop]: === Iteration 771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:38,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:38,667 INFO L82 PathProgramCache]: Analyzing trace with hash -784547768, now seen corresponding path program 763 times [2020-02-10 20:22:38,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:38,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594616360] [2020-02-10 20:22:38,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:39,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594616360] [2020-02-10 20:22:39,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:39,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:39,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546151253] [2020-02-10 20:22:39,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:39,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:39,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:39,196 INFO L87 Difference]: Start difference. First operand 1569 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:22:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:39,371 INFO L93 Difference]: Finished difference Result 2976 states and 11770 transitions. [2020-02-10 20:22:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:39,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:39,378 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:22:39,378 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:22:39,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:22:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1583. [2020-02-10 20:22:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:22:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7082 transitions. [2020-02-10 20:22:39,442 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7082 transitions. Word has length 28 [2020-02-10 20:22:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:39,442 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7082 transitions. [2020-02-10 20:22:39,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7082 transitions. [2020-02-10 20:22:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:39,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:39,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:39,444 INFO L427 AbstractCegarLoop]: === Iteration 772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:39,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:39,445 INFO L82 PathProgramCache]: Analyzing trace with hash -39845270, now seen corresponding path program 764 times [2020-02-10 20:22:39,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:39,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239022563] [2020-02-10 20:22:39,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:39,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239022563] [2020-02-10 20:22:39,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:39,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:39,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584157963] [2020-02-10 20:22:39,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:39,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:39,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:39,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:39,983 INFO L87 Difference]: Start difference. First operand 1583 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:22:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:40,130 INFO L93 Difference]: Finished difference Result 2980 states and 11771 transitions. [2020-02-10 20:22:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:40,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:40,138 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:22:40,139 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:22:40,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:22:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1576. [2020-02-10 20:22:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:22:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7062 transitions. [2020-02-10 20:22:40,202 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7062 transitions. Word has length 28 [2020-02-10 20:22:40,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:40,202 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7062 transitions. [2020-02-10 20:22:40,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7062 transitions. [2020-02-10 20:22:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:40,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:40,205 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:40,205 INFO L427 AbstractCegarLoop]: === Iteration 773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:40,205 INFO L82 PathProgramCache]: Analyzing trace with hash 291163388, now seen corresponding path program 765 times [2020-02-10 20:22:40,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:40,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480798337] [2020-02-10 20:22:40,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:40,648 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-02-10 20:22:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:40,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480798337] [2020-02-10 20:22:40,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:40,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:40,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538027455] [2020-02-10 20:22:40,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:40,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:40,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:40,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:40,766 INFO L87 Difference]: Start difference. First operand 1576 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:22:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:40,959 INFO L93 Difference]: Finished difference Result 2972 states and 11756 transitions. [2020-02-10 20:22:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:40,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:40,967 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:22:40,967 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:22:40,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:22:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1582. [2020-02-10 20:22:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:22:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7073 transitions. [2020-02-10 20:22:41,031 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7073 transitions. Word has length 28 [2020-02-10 20:22:41,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:41,031 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7073 transitions. [2020-02-10 20:22:41,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7073 transitions. [2020-02-10 20:22:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:41,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:41,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, 1, 1, 1] [2020-02-10 20:22:41,034 INFO L427 AbstractCegarLoop]: === Iteration 774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1209113578, now seen corresponding path program 766 times [2020-02-10 20:22:41,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:41,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537059974] [2020-02-10 20:22:41,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:41,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537059974] [2020-02-10 20:22:41,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:41,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:41,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018341858] [2020-02-10 20:22:41,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:41,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:41,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:41,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:41,571 INFO L87 Difference]: Start difference. First operand 1582 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:22:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:41,785 INFO L93 Difference]: Finished difference Result 2973 states and 11752 transitions. [2020-02-10 20:22:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:41,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:41,793 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:22:41,793 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:22:41,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:22:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1576. [2020-02-10 20:22:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:22:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7056 transitions. [2020-02-10 20:22:41,858 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7056 transitions. Word has length 28 [2020-02-10 20:22:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:41,858 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7056 transitions. [2020-02-10 20:22:41,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7056 transitions. [2020-02-10 20:22:41,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:41,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:41,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:41,861 INFO L427 AbstractCegarLoop]: === Iteration 775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:41,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:41,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1648160452, now seen corresponding path program 767 times [2020-02-10 20:22:41,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:41,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121405791] [2020-02-10 20:22:41,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:42,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121405791] [2020-02-10 20:22:42,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:42,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:42,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449650827] [2020-02-10 20:22:42,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:42,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:42,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:42,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:42,397 INFO L87 Difference]: Start difference. First operand 1576 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:22:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:42,552 INFO L93 Difference]: Finished difference Result 2982 states and 11769 transitions. [2020-02-10 20:22:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:42,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:42,560 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:22:42,560 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:22:42,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:42,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:22:42,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1584. [2020-02-10 20:22:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:22:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7070 transitions. [2020-02-10 20:22:42,624 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7070 transitions. Word has length 28 [2020-02-10 20:22:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:42,624 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7070 transitions. [2020-02-10 20:22:42,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7070 transitions. [2020-02-10 20:22:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:42,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:42,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:42,627 INFO L427 AbstractCegarLoop]: === Iteration 776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:42,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:42,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1474912760, now seen corresponding path program 768 times [2020-02-10 20:22:42,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:42,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139077794] [2020-02-10 20:22:42,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:43,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139077794] [2020-02-10 20:22:43,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:43,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:43,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027687976] [2020-02-10 20:22:43,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:43,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:43,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:43,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:43,155 INFO L87 Difference]: Start difference. First operand 1584 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:22:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:43,343 INFO L93 Difference]: Finished difference Result 2979 states and 11756 transitions. [2020-02-10 20:22:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:43,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:43,351 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:22:43,352 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:22:43,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:22:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1563. [2020-02-10 20:22:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:22:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7026 transitions. [2020-02-10 20:22:43,415 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7026 transitions. Word has length 28 [2020-02-10 20:22:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:43,415 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7026 transitions. [2020-02-10 20:22:43,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7026 transitions. [2020-02-10 20:22:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:43,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:43,418 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:43,418 INFO L427 AbstractCegarLoop]: === Iteration 777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:43,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:43,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1292451582, now seen corresponding path program 769 times [2020-02-10 20:22:43,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:43,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082498238] [2020-02-10 20:22:43,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:43,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082498238] [2020-02-10 20:22:43,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:43,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:43,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336493134] [2020-02-10 20:22:43,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:43,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:43,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:43,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:43,950 INFO L87 Difference]: Start difference. First operand 1563 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:22:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:44,214 INFO L93 Difference]: Finished difference Result 2948 states and 11716 transitions. [2020-02-10 20:22:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:44,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:44,222 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:22:44,222 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:22:44,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:22:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1578. [2020-02-10 20:22:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:22:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7078 transitions. [2020-02-10 20:22:44,285 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7078 transitions. Word has length 28 [2020-02-10 20:22:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:44,286 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7078 transitions. [2020-02-10 20:22:44,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7078 transitions. [2020-02-10 20:22:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:44,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:44,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:44,288 INFO L427 AbstractCegarLoop]: === Iteration 778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash -547749084, now seen corresponding path program 770 times [2020-02-10 20:22:44,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:44,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895799500] [2020-02-10 20:22:44,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:44,823 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:22:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:44,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895799500] [2020-02-10 20:22:44,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:44,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:44,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742997436] [2020-02-10 20:22:44,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:44,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:44,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:44,831 INFO L87 Difference]: Start difference. First operand 1578 states and 7078 transitions. Second operand 11 states. [2020-02-10 20:22:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:45,024 INFO L93 Difference]: Finished difference Result 2949 states and 11713 transitions. [2020-02-10 20:22:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:45,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:45,032 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:22:45,032 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:22:45,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:22:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1573. [2020-02-10 20:22:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:22:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7064 transitions. [2020-02-10 20:22:45,095 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7064 transitions. Word has length 28 [2020-02-10 20:22:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:45,095 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7064 transitions. [2020-02-10 20:22:45,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7064 transitions. [2020-02-10 20:22:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:45,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:45,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:45,098 INFO L427 AbstractCegarLoop]: === Iteration 779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1929430334, now seen corresponding path program 771 times [2020-02-10 20:22:45,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:45,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259103997] [2020-02-10 20:22:45,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:45,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259103997] [2020-02-10 20:22:45,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:45,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:45,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106247472] [2020-02-10 20:22:45,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:45,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:45,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:45,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:45,624 INFO L87 Difference]: Start difference. First operand 1573 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:22:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:45,854 INFO L93 Difference]: Finished difference Result 2950 states and 11715 transitions. [2020-02-10 20:22:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:45,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:45,862 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:22:45,862 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:22:45,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:22:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1578. [2020-02-10 20:22:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:22:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 20:22:45,925 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 20:22:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:45,926 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 20:22:45,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 20:22:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:45,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:45,928 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:45,928 INFO L427 AbstractCegarLoop]: === Iteration 780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash -131429468, now seen corresponding path program 772 times [2020-02-10 20:22:45,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:45,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753038864] [2020-02-10 20:22:45,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:46,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753038864] [2020-02-10 20:22:46,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:46,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:46,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790663868] [2020-02-10 20:22:46,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:46,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:46,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:46,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:46,445 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:22:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:46,658 INFO L93 Difference]: Finished difference Result 2953 states and 11716 transitions. [2020-02-10 20:22:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:46,659 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:46,666 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:22:46,666 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:22:46,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:22:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1573. [2020-02-10 20:22:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:22:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7059 transitions. [2020-02-10 20:22:46,729 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7059 transitions. Word has length 28 [2020-02-10 20:22:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:46,729 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7059 transitions. [2020-02-10 20:22:46,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7059 transitions. [2020-02-10 20:22:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:46,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:46,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:46,732 INFO L427 AbstractCegarLoop]: === Iteration 781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash -9893506, now seen corresponding path program 773 times [2020-02-10 20:22:46,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:46,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378460118] [2020-02-10 20:22:46,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:47,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378460118] [2020-02-10 20:22:47,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:47,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:47,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777982943] [2020-02-10 20:22:47,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:47,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:47,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:47,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:47,252 INFO L87 Difference]: Start difference. First operand 1573 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:22:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:47,441 INFO L93 Difference]: Finished difference Result 2953 states and 11717 transitions. [2020-02-10 20:22:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:47,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:47,449 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:22:47,449 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:22:47,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:22:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1579. [2020-02-10 20:22:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:22:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7070 transitions. [2020-02-10 20:22:47,513 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7070 transitions. Word has length 28 [2020-02-10 20:22:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:47,513 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7070 transitions. [2020-02-10 20:22:47,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7070 transitions. [2020-02-10 20:22:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:47,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:47,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:47,515 INFO L427 AbstractCegarLoop]: === Iteration 782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1479511490, now seen corresponding path program 774 times [2020-02-10 20:22:47,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:47,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482177150] [2020-02-10 20:22:47,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:48,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482177150] [2020-02-10 20:22:48,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:48,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:48,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709195972] [2020-02-10 20:22:48,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:48,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:48,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:48,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:48,036 INFO L87 Difference]: Start difference. First operand 1579 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:22:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:48,220 INFO L93 Difference]: Finished difference Result 2955 states and 11715 transitions. [2020-02-10 20:22:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:48,220 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:48,227 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:22:48,227 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:22:48,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:48,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:22:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1568. [2020-02-10 20:22:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:22:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7045 transitions. [2020-02-10 20:22:48,291 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7045 transitions. Word has length 28 [2020-02-10 20:22:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:48,291 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7045 transitions. [2020-02-10 20:22:48,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7045 transitions. [2020-02-10 20:22:48,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:48,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:48,293 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:48,293 INFO L427 AbstractCegarLoop]: === Iteration 783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:48,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:48,293 INFO L82 PathProgramCache]: Analyzing trace with hash -704706260, now seen corresponding path program 775 times [2020-02-10 20:22:48,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:48,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784929616] [2020-02-10 20:22:48,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:48,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784929616] [2020-02-10 20:22:48,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:48,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:48,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938922400] [2020-02-10 20:22:48,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:48,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:48,821 INFO L87 Difference]: Start difference. First operand 1568 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:22:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:48,995 INFO L93 Difference]: Finished difference Result 2947 states and 11709 transitions. [2020-02-10 20:22:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:48,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:49,002 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:22:49,002 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:22:49,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:22:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1578. [2020-02-10 20:22:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:22:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 20:22:49,066 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 20:22:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:49,066 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 20:22:49,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 20:22:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:49,069 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:49,069 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:49,069 INFO L427 AbstractCegarLoop]: === Iteration 784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash 39996238, now seen corresponding path program 776 times [2020-02-10 20:22:49,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:49,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492477129] [2020-02-10 20:22:49,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:49,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492477129] [2020-02-10 20:22:49,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:49,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:49,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844716578] [2020-02-10 20:22:49,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:49,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:49,603 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:22:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:49,785 INFO L93 Difference]: Finished difference Result 2948 states and 11706 transitions. [2020-02-10 20:22:49,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:49,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:49,792 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:22:49,793 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:22:49,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:22:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1573. [2020-02-10 20:22:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:22:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7059 transitions. [2020-02-10 20:22:49,856 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7059 transitions. Word has length 28 [2020-02-10 20:22:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:49,857 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7059 transitions. [2020-02-10 20:22:49,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7059 transitions. [2020-02-10 20:22:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:49,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22: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, 1, 1, 1] [2020-02-10 20:22:49,859 INFO L427 AbstractCegarLoop]: === Iteration 785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1981945854, now seen corresponding path program 777 times [2020-02-10 20:22:49,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:49,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359286373] [2020-02-10 20:22:49,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:50,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359286373] [2020-02-10 20:22:50,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:50,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:50,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655433080] [2020-02-10 20:22:50,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:50,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:50,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:50,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:50,385 INFO L87 Difference]: Start difference. First operand 1573 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:22:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:50,565 INFO L93 Difference]: Finished difference Result 2948 states and 11706 transitions. [2020-02-10 20:22:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:50,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:50,573 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:22:50,574 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:22:50,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:22:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1578. [2020-02-10 20:22:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:22:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 20:22:50,637 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 20:22:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:50,638 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 20:22:50,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 20:22:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:50,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:50,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:50,640 INFO L427 AbstractCegarLoop]: === Iteration 786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash -650368754, now seen corresponding path program 778 times [2020-02-10 20:22:50,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:50,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677214690] [2020-02-10 20:22:50,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:51,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677214690] [2020-02-10 20:22:51,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:51,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:51,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797324953] [2020-02-10 20:22:51,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:51,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:51,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:51,171 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:22:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:51,348 INFO L93 Difference]: Finished difference Result 2950 states and 11705 transitions. [2020-02-10 20:22:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:51,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:51,355 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:22:51,355 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:22:51,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:22:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1573. [2020-02-10 20:22:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:22:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7054 transitions. [2020-02-10 20:22:51,418 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7054 transitions. Word has length 28 [2020-02-10 20:22:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:51,418 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7054 transitions. [2020-02-10 20:22:51,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7054 transitions. [2020-02-10 20:22:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:51,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:51,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:51,421 INFO L427 AbstractCegarLoop]: === Iteration 787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:51,421 INFO L82 PathProgramCache]: Analyzing trace with hash 42622014, now seen corresponding path program 779 times [2020-02-10 20:22:51,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:51,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465105513] [2020-02-10 20:22:51,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:51,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465105513] [2020-02-10 20:22:51,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:51,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:51,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698983251] [2020-02-10 20:22:51,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:51,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:51,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:51,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:51,964 INFO L87 Difference]: Start difference. First operand 1573 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:22:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:52,171 INFO L93 Difference]: Finished difference Result 2951 states and 11708 transitions. [2020-02-10 20:22:52,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:52,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:52,178 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:22:52,178 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:22:52,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:22:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1579. [2020-02-10 20:22:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:22:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7065 transitions. [2020-02-10 20:22:52,242 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7065 transitions. Word has length 28 [2020-02-10 20:22:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:52,242 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7065 transitions. [2020-02-10 20:22:52,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7065 transitions. [2020-02-10 20:22:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:52,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:52,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:52,244 INFO L427 AbstractCegarLoop]: === Iteration 788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:52,245 INFO L82 PathProgramCache]: Analyzing trace with hash 960572204, now seen corresponding path program 780 times [2020-02-10 20:22:52,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:52,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312852001] [2020-02-10 20:22:52,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:52,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312852001] [2020-02-10 20:22:52,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:52,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:52,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624828045] [2020-02-10 20:22:52,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:52,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:52,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:52,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:52,810 INFO L87 Difference]: Start difference. First operand 1579 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:22:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:52,983 INFO L93 Difference]: Finished difference Result 2952 states and 11704 transitions. [2020-02-10 20:22:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:52,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:52,991 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:22:52,991 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:22:52,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:22:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1568. [2020-02-10 20:22:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:22:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7040 transitions. [2020-02-10 20:22:53,055 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7040 transitions. Word has length 28 [2020-02-10 20:22:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:53,055 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7040 transitions. [2020-02-10 20:22:53,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7040 transitions. [2020-02-10 20:22:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:53,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:53,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:53,057 INFO L427 AbstractCegarLoop]: === Iteration 789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:53,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:53,058 INFO L82 PathProgramCache]: Analyzing trace with hash -683700052, now seen corresponding path program 781 times [2020-02-10 20:22:53,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:53,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837349367] [2020-02-10 20:22:53,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:53,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837349367] [2020-02-10 20:22:53,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:53,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:53,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140240050] [2020-02-10 20:22:53,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:53,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:53,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:53,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:53,584 INFO L87 Difference]: Start difference. First operand 1568 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:22:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:53,768 INFO L93 Difference]: Finished difference Result 2952 states and 11715 transitions. [2020-02-10 20:22:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:53,768 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:53,775 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:22:53,775 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:22:53,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:22:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1578. [2020-02-10 20:22:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:22:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 20:22:53,839 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 20:22:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:53,839 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 20:22:53,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 20:22:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:53,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:53,841 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:53,841 INFO L427 AbstractCegarLoop]: === Iteration 790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:53,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1550407442, now seen corresponding path program 782 times [2020-02-10 20:22:53,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:53,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617721820] [2020-02-10 20:22:53,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:54,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617721820] [2020-02-10 20:22:54,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:54,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:54,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685206672] [2020-02-10 20:22:54,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:54,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:54,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:54,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:54,370 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:22:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:54,549 INFO L93 Difference]: Finished difference Result 2955 states and 11716 transitions. [2020-02-10 20:22:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:54,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:54,556 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:22:54,556 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:22:54,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:22:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1573. [2020-02-10 20:22:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:22:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7054 transitions. [2020-02-10 20:22:54,620 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7054 transitions. Word has length 28 [2020-02-10 20:22:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:54,620 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7054 transitions. [2020-02-10 20:22:54,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7054 transitions. [2020-02-10 20:22:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:54,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:54,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:54,622 INFO L427 AbstractCegarLoop]: === Iteration 791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:54,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:54,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1218929854, now seen corresponding path program 783 times [2020-02-10 20:22:54,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:54,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22903563] [2020-02-10 20:22:54,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:55,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22903563] [2020-02-10 20:22:55,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:55,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:55,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797870361] [2020-02-10 20:22:55,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:55,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:55,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:55,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:55,144 INFO L87 Difference]: Start difference. First operand 1573 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:22:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:55,318 INFO L93 Difference]: Finished difference Result 2951 states and 11708 transitions. [2020-02-10 20:22:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:55,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:55,325 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:22:55,325 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:22:55,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:22:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1578. [2020-02-10 20:22:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:22:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7063 transitions. [2020-02-10 20:22:55,388 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7063 transitions. Word has length 28 [2020-02-10 20:22:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:55,389 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7063 transitions. [2020-02-10 20:22:55,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:55,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7063 transitions. [2020-02-10 20:22:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:55,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:55,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:55,391 INFO L427 AbstractCegarLoop]: === Iteration 792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:55,391 INFO L82 PathProgramCache]: Analyzing trace with hash 443722834, now seen corresponding path program 784 times [2020-02-10 20:22:55,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:55,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531316409] [2020-02-10 20:22:55,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:55,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531316409] [2020-02-10 20:22:55,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:55,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:55,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081958935] [2020-02-10 20:22:55,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:55,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:55,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:55,919 INFO L87 Difference]: Start difference. First operand 1578 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:22:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:56,108 INFO L93 Difference]: Finished difference Result 2953 states and 11707 transitions. [2020-02-10 20:22:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:56,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:56,115 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:22:56,116 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 20:22:56,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 20:22:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1573. [2020-02-10 20:22:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:22:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7049 transitions. [2020-02-10 20:22:56,179 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7049 transitions. Word has length 28 [2020-02-10 20:22:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:56,179 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7049 transitions. [2020-02-10 20:22:56,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7049 transitions. [2020-02-10 20:22:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:56,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:56,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:56,182 INFO L427 AbstractCegarLoop]: === Iteration 793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:56,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1553033218, now seen corresponding path program 785 times [2020-02-10 20:22:56,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:56,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314235050] [2020-02-10 20:22:56,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:56,709 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:22:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:56,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314235050] [2020-02-10 20:22:56,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:56,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:56,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192217554] [2020-02-10 20:22:56,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:56,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:56,717 INFO L87 Difference]: Start difference. First operand 1573 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:22:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:56,929 INFO L93 Difference]: Finished difference Result 2959 states and 11721 transitions. [2020-02-10 20:22:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:56,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:56,936 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:22:56,936 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:22:56,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:22:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1580. [2020-02-10 20:22:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:22:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7062 transitions. [2020-02-10 20:22:57,000 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7062 transitions. Word has length 28 [2020-02-10 20:22:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:57,000 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7062 transitions. [2020-02-10 20:22:57,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7062 transitions. [2020-02-10 20:22:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:57,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:57,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:57,002 INFO L427 AbstractCegarLoop]: === Iteration 794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:57,003 INFO L82 PathProgramCache]: Analyzing trace with hash 981578412, now seen corresponding path program 786 times [2020-02-10 20:22:57,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:57,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789570870] [2020-02-10 20:22:57,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:57,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789570870] [2020-02-10 20:22:57,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:57,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:57,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806013837] [2020-02-10 20:22:57,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:57,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:57,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:57,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:57,531 INFO L87 Difference]: Start difference. First operand 1580 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:22:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:57,741 INFO L93 Difference]: Finished difference Result 2958 states and 11712 transitions. [2020-02-10 20:22:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:57,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:57,749 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:22:57,749 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:22:57,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:22:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1568. [2020-02-10 20:22:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:22:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7035 transitions. [2020-02-10 20:22:57,815 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7035 transitions. Word has length 28 [2020-02-10 20:22:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:57,815 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7035 transitions. [2020-02-10 20:22:57,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7035 transitions. [2020-02-10 20:22:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:57,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:57,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:57,817 INFO L427 AbstractCegarLoop]: === Iteration 795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:57,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:57,817 INFO L82 PathProgramCache]: Analyzing trace with hash 71505550, now seen corresponding path program 787 times [2020-02-10 20:22:57,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:57,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810720919] [2020-02-10 20:22:57,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:58,368 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:22:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:58,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810720919] [2020-02-10 20:22:58,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:58,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:58,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83053998] [2020-02-10 20:22:58,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:58,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:58,376 INFO L87 Difference]: Start difference. First operand 1568 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:22:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:58,608 INFO L93 Difference]: Finished difference Result 2959 states and 11729 transitions. [2020-02-10 20:22:58,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:58,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:58,616 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:22:58,616 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:22:58,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:22:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1580. [2020-02-10 20:22:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:22:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7069 transitions. [2020-02-10 20:22:58,680 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7069 transitions. Word has length 28 [2020-02-10 20:22:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:58,680 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7069 transitions. [2020-02-10 20:22:58,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7069 transitions. [2020-02-10 20:22:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:58,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:58,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:58,682 INFO L427 AbstractCegarLoop]: === Iteration 796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1560910546, now seen corresponding path program 788 times [2020-02-10 20:22:58,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:58,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071094864] [2020-02-10 20:22:58,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:59,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071094864] [2020-02-10 20:22:59,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:59,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:22:59,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599962887] [2020-02-10 20:22:59,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:22:59,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:59,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:22:59,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:59,209 INFO L87 Difference]: Start difference. First operand 1580 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:22:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:59,444 INFO L93 Difference]: Finished difference Result 2961 states and 11727 transitions. [2020-02-10 20:22:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:22:59,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:22:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:59,451 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:22:59,451 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:22:59,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:22:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:22:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1574. [2020-02-10 20:22:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:22:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7052 transitions. [2020-02-10 20:22:59,516 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7052 transitions. Word has length 28 [2020-02-10 20:22:59,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:59,516 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7052 transitions. [2020-02-10 20:22:59,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:22:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7052 transitions. [2020-02-10 20:22:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:22:59,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:59,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, 1, 1, 1] [2020-02-10 20:22:59,519 INFO L427 AbstractCegarLoop]: === Iteration 797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:59,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash -463724252, now seen corresponding path program 789 times [2020-02-10 20:22:59,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:59,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790469801] [2020-02-10 20:22:59,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:00,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790469801] [2020-02-10 20:23:00,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:00,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:00,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141296842] [2020-02-10 20:23:00,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:00,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:00,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:00,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:00,054 INFO L87 Difference]: Start difference. First operand 1574 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:23:00,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:00,253 INFO L93 Difference]: Finished difference Result 2958 states and 11721 transitions. [2020-02-10 20:23:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:00,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:00,260 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:23:00,261 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:23:00,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:23:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1580. [2020-02-10 20:23:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:23:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7063 transitions. [2020-02-10 20:23:00,324 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7063 transitions. Word has length 28 [2020-02-10 20:23:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:00,324 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7063 transitions. [2020-02-10 20:23:00,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7063 transitions. [2020-02-10 20:23:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:00,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:00,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:00,327 INFO L427 AbstractCegarLoop]: === Iteration 798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:00,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:00,327 INFO L82 PathProgramCache]: Analyzing trace with hash 454225938, now seen corresponding path program 790 times [2020-02-10 20:23:00,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:00,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242243593] [2020-02-10 20:23:00,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:00,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242243593] [2020-02-10 20:23:00,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:00,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:00,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184847735] [2020-02-10 20:23:00,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:00,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:00,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:00,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:00,872 INFO L87 Difference]: Start difference. First operand 1580 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:23:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:01,089 INFO L93 Difference]: Finished difference Result 2959 states and 11717 transitions. [2020-02-10 20:23:01,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:01,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:01,097 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:23:01,097 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:23:01,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:23:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1574. [2020-02-10 20:23:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:23:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7046 transitions. [2020-02-10 20:23:01,163 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7046 transitions. Word has length 28 [2020-02-10 20:23:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:01,164 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7046 transitions. [2020-02-10 20:23:01,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7046 transitions. [2020-02-10 20:23:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:01,166 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:01,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:01,166 INFO L427 AbstractCegarLoop]: === Iteration 799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:01,166 INFO L82 PathProgramCache]: Analyzing trace with hash -47404636, now seen corresponding path program 791 times [2020-02-10 20:23:01,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:01,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111935831] [2020-02-10 20:23:01,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:01,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111935831] [2020-02-10 20:23:01,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:01,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:01,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818434194] [2020-02-10 20:23:01,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:01,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:01,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:01,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:01,701 INFO L87 Difference]: Start difference. First operand 1574 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:23:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:01,872 INFO L93 Difference]: Finished difference Result 2963 states and 11726 transitions. [2020-02-10 20:23:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:01,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:01,880 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:23:01,880 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:23:01,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:23:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1581. [2020-02-10 20:23:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:23:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7059 transitions. [2020-02-10 20:23:01,945 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7059 transitions. Word has length 28 [2020-02-10 20:23:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:01,946 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7059 transitions. [2020-02-10 20:23:01,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7059 transitions. [2020-02-10 20:23:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:01,948 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:01,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, 1, 1, 1] [2020-02-10 20:23:01,948 INFO L427 AbstractCegarLoop]: === Iteration 800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash -618859442, now seen corresponding path program 792 times [2020-02-10 20:23:01,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:01,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216325627] [2020-02-10 20:23:01,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:02,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216325627] [2020-02-10 20:23:02,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:02,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:02,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150134930] [2020-02-10 20:23:02,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:02,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:02,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:02,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:02,484 INFO L87 Difference]: Start difference. First operand 1581 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:23:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:02,715 INFO L93 Difference]: Finished difference Result 2962 states and 11717 transitions. [2020-02-10 20:23:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:02,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:02,723 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:23:02,723 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:23:02,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:23:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1563. [2020-02-10 20:23:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:23:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7021 transitions. [2020-02-10 20:23:02,790 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7021 transitions. Word has length 28 [2020-02-10 20:23:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:02,790 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7021 transitions. [2020-02-10 20:23:02,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7021 transitions. [2020-02-10 20:23:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:02,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:02,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:02,792 INFO L427 AbstractCegarLoop]: === Iteration 801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:02,793 INFO L82 PathProgramCache]: Analyzing trace with hash 644085600, now seen corresponding path program 793 times [2020-02-10 20:23:02,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:02,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478563569] [2020-02-10 20:23:02,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:03,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478563569] [2020-02-10 20:23:03,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:03,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:03,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381321030] [2020-02-10 20:23:03,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:03,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:03,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:03,329 INFO L87 Difference]: Start difference. First operand 1563 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:23:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:03,507 INFO L93 Difference]: Finished difference Result 2985 states and 11793 transitions. [2020-02-10 20:23:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:03,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:03,514 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:23:03,515 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:23:03,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:23:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1584. [2020-02-10 20:23:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:23:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7089 transitions. [2020-02-10 20:23:03,579 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7089 transitions. Word has length 28 [2020-02-10 20:23:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:03,579 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7089 transitions. [2020-02-10 20:23:03,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7089 transitions. [2020-02-10 20:23:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:03,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:03,582 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:03,582 INFO L427 AbstractCegarLoop]: === Iteration 802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:03,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:03,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2133490596, now seen corresponding path program 794 times [2020-02-10 20:23:03,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:03,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674760892] [2020-02-10 20:23:03,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:04,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674760892] [2020-02-10 20:23:04,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:04,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:04,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837535457] [2020-02-10 20:23:04,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:04,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:04,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:04,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:04,118 INFO L87 Difference]: Start difference. First operand 1584 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:23:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:04,283 INFO L93 Difference]: Finished difference Result 2990 states and 11797 transitions. [2020-02-10 20:23:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:04,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:04,290 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:23:04,290 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:23:04,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:23:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1578. [2020-02-10 20:23:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:23:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7072 transitions. [2020-02-10 20:23:04,376 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7072 transitions. Word has length 28 [2020-02-10 20:23:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:04,376 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7072 transitions. [2020-02-10 20:23:04,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7072 transitions. [2020-02-10 20:23:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:04,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:04,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:04,379 INFO L427 AbstractCegarLoop]: === Iteration 803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2039940738, now seen corresponding path program 795 times [2020-02-10 20:23:04,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:04,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891500552] [2020-02-10 20:23:04,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:04,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891500552] [2020-02-10 20:23:04,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:04,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:04,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159412662] [2020-02-10 20:23:04,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:04,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:04,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:04,913 INFO L87 Difference]: Start difference. First operand 1578 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:23:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:05,115 INFO L93 Difference]: Finished difference Result 2982 states and 11782 transitions. [2020-02-10 20:23:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:05,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:05,123 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:23:05,123 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 20:23:05,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 20:23:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1583. [2020-02-10 20:23:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:23:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7081 transitions. [2020-02-10 20:23:05,189 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7081 transitions. Word has length 28 [2020-02-10 20:23:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:05,189 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7081 transitions. [2020-02-10 20:23:05,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7081 transitions. [2020-02-10 20:23:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:05,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:05,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:05,192 INFO L427 AbstractCegarLoop]: === Iteration 804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:05,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash 194166756, now seen corresponding path program 796 times [2020-02-10 20:23:05,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:05,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797389762] [2020-02-10 20:23:05,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:05,717 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:23:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:05,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797389762] [2020-02-10 20:23:05,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:05,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:05,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603023311] [2020-02-10 20:23:05,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:05,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:05,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:05,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:05,725 INFO L87 Difference]: Start difference. First operand 1583 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:23:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:05,929 INFO L93 Difference]: Finished difference Result 2985 states and 11783 transitions. [2020-02-10 20:23:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:05,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:05,937 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:23:05,937 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:23:05,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:23:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1578. [2020-02-10 20:23:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:23:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7067 transitions. [2020-02-10 20:23:06,001 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7067 transitions. Word has length 28 [2020-02-10 20:23:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:06,001 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7067 transitions. [2020-02-10 20:23:06,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7067 transitions. [2020-02-10 20:23:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:06,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:06,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:06,004 INFO L427 AbstractCegarLoop]: === Iteration 805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:06,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1623621122, now seen corresponding path program 797 times [2020-02-10 20:23:06,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:06,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905664380] [2020-02-10 20:23:06,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:06,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905664380] [2020-02-10 20:23:06,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:06,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:06,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826677842] [2020-02-10 20:23:06,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:06,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:06,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:06,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:06,559 INFO L87 Difference]: Start difference. First operand 1578 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:23:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:06,702 INFO L93 Difference]: Finished difference Result 2997 states and 11807 transitions. [2020-02-10 20:23:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:06,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:06,709 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 20:23:06,710 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 20:23:06,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 20:23:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1588. [2020-02-10 20:23:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:23:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7084 transitions. [2020-02-10 20:23:06,774 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7084 transitions. Word has length 28 [2020-02-10 20:23:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:06,774 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7084 transitions. [2020-02-10 20:23:06,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7084 transitions. [2020-02-10 20:23:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:06,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:06,776 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:06,777 INFO L427 AbstractCegarLoop]: === Iteration 806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:06,777 INFO L82 PathProgramCache]: Analyzing trace with hash -878918624, now seen corresponding path program 798 times [2020-02-10 20:23:06,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:06,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541952578] [2020-02-10 20:23:06,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:07,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541952578] [2020-02-10 20:23:07,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:07,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:07,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172502081] [2020-02-10 20:23:07,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:07,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:07,328 INFO L87 Difference]: Start difference. First operand 1588 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:23:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:07,532 INFO L93 Difference]: Finished difference Result 2995 states and 11795 transitions. [2020-02-10 20:23:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:07,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:07,541 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:23:07,541 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:23:07,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:23:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1571. [2020-02-10 20:23:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:23:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7047 transitions. [2020-02-10 20:23:07,609 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7047 transitions. Word has length 28 [2020-02-10 20:23:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:07,609 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7047 transitions. [2020-02-10 20:23:07,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7047 transitions. [2020-02-10 20:23:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:07,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:07,612 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:07,612 INFO L427 AbstractCegarLoop]: === Iteration 807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:07,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1231830922, now seen corresponding path program 799 times [2020-02-10 20:23:07,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:07,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983834592] [2020-02-10 20:23:07,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:08,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983834592] [2020-02-10 20:23:08,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:08,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:08,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727367634] [2020-02-10 20:23:08,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:08,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:08,139 INFO L87 Difference]: Start difference. First operand 1571 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:23:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:08,315 INFO L93 Difference]: Finished difference Result 2981 states and 11778 transitions. [2020-02-10 20:23:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:08,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:08,323 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:23:08,323 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:23:08,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:23:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1583. [2020-02-10 20:23:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:23:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7080 transitions. [2020-02-10 20:23:08,387 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7080 transitions. Word has length 28 [2020-02-10 20:23:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:08,387 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7080 transitions. [2020-02-10 20:23:08,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7080 transitions. [2020-02-10 20:23:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:08,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:08,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, 1, 1, 1] [2020-02-10 20:23:08,390 INFO L427 AbstractCegarLoop]: === Iteration 808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:08,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1573731378, now seen corresponding path program 800 times [2020-02-10 20:23:08,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:08,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270878350] [2020-02-10 20:23:08,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:08,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270878350] [2020-02-10 20:23:08,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:08,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:08,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554578916] [2020-02-10 20:23:08,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:08,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:08,928 INFO L87 Difference]: Start difference. First operand 1583 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:23:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:09,074 INFO L93 Difference]: Finished difference Result 2986 states and 11782 transitions. [2020-02-10 20:23:09,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:09,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:09,081 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:23:09,082 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:23:09,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:23:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1577. [2020-02-10 20:23:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:23:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7063 transitions. [2020-02-10 20:23:09,145 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7063 transitions. Word has length 28 [2020-02-10 20:23:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:09,145 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7063 transitions. [2020-02-10 20:23:09,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7063 transitions. [2020-02-10 20:23:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:09,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:09,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:09,148 INFO L427 AbstractCegarLoop]: === Iteration 809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1987425218, now seen corresponding path program 801 times [2020-02-10 20:23:09,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:09,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370782482] [2020-02-10 20:23:09,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:09,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370782482] [2020-02-10 20:23:09,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:09,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:09,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215846834] [2020-02-10 20:23:09,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:09,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:09,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:09,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:09,676 INFO L87 Difference]: Start difference. First operand 1577 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:23:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:09,901 INFO L93 Difference]: Finished difference Result 2977 states and 11765 transitions. [2020-02-10 20:23:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:09,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:09,908 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:23:09,908 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:23:09,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:23:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1582. [2020-02-10 20:23:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:23:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7072 transitions. [2020-02-10 20:23:09,971 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7072 transitions. Word has length 28 [2020-02-10 20:23:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:09,972 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7072 transitions. [2020-02-10 20:23:09,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7072 transitions. [2020-02-10 20:23:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:09,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:09,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:09,974 INFO L427 AbstractCegarLoop]: === Iteration 810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash -324772530, now seen corresponding path program 802 times [2020-02-10 20:23:09,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:09,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602455226] [2020-02-10 20:23:09,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:10,410 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2020-02-10 20:23:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:10,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602455226] [2020-02-10 20:23:10,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:10,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:10,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062349775] [2020-02-10 20:23:10,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:10,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:10,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:10,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:10,527 INFO L87 Difference]: Start difference. First operand 1582 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:23:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:10,713 INFO L93 Difference]: Finished difference Result 2979 states and 11764 transitions. [2020-02-10 20:23:10,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:10,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:10,721 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:23:10,721 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:23:10,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:23:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1577. [2020-02-10 20:23:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:23:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7058 transitions. [2020-02-10 20:23:10,785 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7058 transitions. Word has length 28 [2020-02-10 20:23:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:10,785 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7058 transitions. [2020-02-10 20:23:10,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7058 transitions. [2020-02-10 20:23:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:10,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:10,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:10,788 INFO L427 AbstractCegarLoop]: === Iteration 811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:10,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:10,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1571105602, now seen corresponding path program 803 times [2020-02-10 20:23:10,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:10,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877797156] [2020-02-10 20:23:10,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:11,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877797156] [2020-02-10 20:23:11,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:11,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:11,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216840735] [2020-02-10 20:23:11,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:11,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:11,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:11,326 INFO L87 Difference]: Start difference. First operand 1577 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:23:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:11,493 INFO L93 Difference]: Finished difference Result 2990 states and 11786 transitions. [2020-02-10 20:23:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:11,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:11,501 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:23:11,501 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:23:11,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:23:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1585. [2020-02-10 20:23:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:23:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7072 transitions. [2020-02-10 20:23:11,565 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7072 transitions. Word has length 28 [2020-02-10 20:23:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:11,565 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7072 transitions. [2020-02-10 20:23:11,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7072 transitions. [2020-02-10 20:23:11,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:11,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:11,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:11,568 INFO L427 AbstractCegarLoop]: === Iteration 812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1397857910, now seen corresponding path program 804 times [2020-02-10 20:23:11,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:11,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430485108] [2020-02-10 20:23:11,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:12,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430485108] [2020-02-10 20:23:12,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:12,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:12,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124617833] [2020-02-10 20:23:12,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:12,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:12,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:12,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:12,113 INFO L87 Difference]: Start difference. First operand 1585 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:23:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:12,282 INFO L93 Difference]: Finished difference Result 2987 states and 11773 transitions. [2020-02-10 20:23:12,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:12,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:12,290 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 20:23:12,290 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:23:12,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:23:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1571. [2020-02-10 20:23:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:23:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7041 transitions. [2020-02-10 20:23:12,354 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7041 transitions. Word has length 28 [2020-02-10 20:23:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:12,354 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7041 transitions. [2020-02-10 20:23:12,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7041 transitions. [2020-02-10 20:23:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:12,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:12,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:12,357 INFO L427 AbstractCegarLoop]: === Iteration 813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:12,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1242334026, now seen corresponding path program 805 times [2020-02-10 20:23:12,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:12,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156333947] [2020-02-10 20:23:12,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:12,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156333947] [2020-02-10 20:23:12,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:12,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:12,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60514552] [2020-02-10 20:23:12,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:12,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:12,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:12,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:12,886 INFO L87 Difference]: Start difference. First operand 1571 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:23:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:13,080 INFO L93 Difference]: Finished difference Result 2973 states and 11757 transitions. [2020-02-10 20:23:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:13,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:13,087 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:23:13,087 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:23:13,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:23:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1581. [2020-02-10 20:23:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:23:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7069 transitions. [2020-02-10 20:23:13,151 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7069 transitions. Word has length 28 [2020-02-10 20:23:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:13,151 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7069 transitions. [2020-02-10 20:23:13,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7069 transitions. [2020-02-10 20:23:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:13,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:13,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:13,153 INFO L427 AbstractCegarLoop]: === Iteration 814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:13,154 INFO L82 PathProgramCache]: Analyzing trace with hash -818525776, now seen corresponding path program 806 times [2020-02-10 20:23:13,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:13,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802171819] [2020-02-10 20:23:13,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:13,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802171819] [2020-02-10 20:23:13,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:13,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:13,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878258989] [2020-02-10 20:23:13,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:13,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:13,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:13,672 INFO L87 Difference]: Start difference. First operand 1581 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:23:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:13,887 INFO L93 Difference]: Finished difference Result 2976 states and 11758 transitions. [2020-02-10 20:23:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:13,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:13,895 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:23:13,895 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:23:13,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:23:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1576. [2020-02-10 20:23:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:23:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7055 transitions. [2020-02-10 20:23:13,959 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7055 transitions. Word has length 28 [2020-02-10 20:23:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:13,959 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7055 transitions. [2020-02-10 20:23:13,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7055 transitions. [2020-02-10 20:23:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:13,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:13,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:13,961 INFO L427 AbstractCegarLoop]: === Iteration 815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:13,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:13,962 INFO L82 PathProgramCache]: Analyzing trace with hash 707104224, now seen corresponding path program 807 times [2020-02-10 20:23:13,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:13,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060133935] [2020-02-10 20:23:13,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:14,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060133935] [2020-02-10 20:23:14,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:14,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:14,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960491786] [2020-02-10 20:23:14,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:14,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:14,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:14,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:14,484 INFO L87 Difference]: Start difference. First operand 1576 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:23:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:14,677 INFO L93 Difference]: Finished difference Result 2972 states and 11750 transitions. [2020-02-10 20:23:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:14,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:14,684 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:23:14,684 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:23:14,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:23:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1581. [2020-02-10 20:23:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:23:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7064 transitions. [2020-02-10 20:23:14,748 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7064 transitions. Word has length 28 [2020-02-10 20:23:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:14,749 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7064 transitions. [2020-02-10 20:23:14,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7064 transitions. [2020-02-10 20:23:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:14,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:14,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:14,751 INFO L427 AbstractCegarLoop]: === Iteration 816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:14,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1925210384, now seen corresponding path program 808 times [2020-02-10 20:23:14,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:14,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359174450] [2020-02-10 20:23:14,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:15,271 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:23:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:15,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359174450] [2020-02-10 20:23:15,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:15,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:15,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037981500] [2020-02-10 20:23:15,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:15,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:15,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:15,279 INFO L87 Difference]: Start difference. First operand 1581 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:23:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:15,489 INFO L93 Difference]: Finished difference Result 2974 states and 11749 transitions. [2020-02-10 20:23:15,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:15,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:15,497 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:23:15,497 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:23:15,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:23:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1576. [2020-02-10 20:23:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:23:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7050 transitions. [2020-02-10 20:23:15,561 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7050 transitions. Word has length 28 [2020-02-10 20:23:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:15,561 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7050 transitions. [2020-02-10 20:23:15,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7050 transitions. [2020-02-10 20:23:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:15,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:15,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:15,563 INFO L427 AbstractCegarLoop]: === Iteration 817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash -815900000, now seen corresponding path program 809 times [2020-02-10 20:23:15,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:15,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267033775] [2020-02-10 20:23:15,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:16,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267033775] [2020-02-10 20:23:16,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:16,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:16,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239002194] [2020-02-10 20:23:16,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:16,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:16,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:16,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:16,088 INFO L87 Difference]: Start difference. First operand 1576 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:23:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:16,310 INFO L93 Difference]: Finished difference Result 2980 states and 11763 transitions. [2020-02-10 20:23:16,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:16,310 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:16,317 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:23:16,317 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:23:16,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:23:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1583. [2020-02-10 20:23:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:23:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7063 transitions. [2020-02-10 20:23:16,404 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7063 transitions. Word has length 28 [2020-02-10 20:23:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:16,404 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7063 transitions. [2020-02-10 20:23:16,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7063 transitions. [2020-02-10 20:23:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:16,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:16,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:16,406 INFO L427 AbstractCegarLoop]: === Iteration 818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:16,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:16,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1387354806, now seen corresponding path program 810 times [2020-02-10 20:23:16,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:16,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075408173] [2020-02-10 20:23:16,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:16,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075408173] [2020-02-10 20:23:16,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:16,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:16,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751694461] [2020-02-10 20:23:16,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:16,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:16,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:16,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:16,932 INFO L87 Difference]: Start difference. First operand 1583 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:23:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:17,191 INFO L93 Difference]: Finished difference Result 2979 states and 11754 transitions. [2020-02-10 20:23:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:17,191 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:17,198 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:23:17,199 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:23:17,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:23:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1571. [2020-02-10 20:23:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:23:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:23:17,262 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:23:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:17,262 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:23:17,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:23:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:17,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:17,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:17,265 INFO L427 AbstractCegarLoop]: === Iteration 819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:17,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1542222066, now seen corresponding path program 811 times [2020-02-10 20:23:17,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:17,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956417549] [2020-02-10 20:23:17,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:17,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956417549] [2020-02-10 20:23:17,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:17,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:17,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347381768] [2020-02-10 20:23:17,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:17,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:17,832 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:23:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:18,014 INFO L93 Difference]: Finished difference Result 3006 states and 11825 transitions. [2020-02-10 20:23:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:18,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:18,022 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:23:18,022 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 20:23:18,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 20:23:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1591. [2020-02-10 20:23:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:23:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7086 transitions. [2020-02-10 20:23:18,091 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7086 transitions. Word has length 28 [2020-02-10 20:23:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:18,091 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7086 transitions. [2020-02-10 20:23:18,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7086 transitions. [2020-02-10 20:23:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:18,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:18,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:18,094 INFO L427 AbstractCegarLoop]: === Iteration 820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash -797519568, now seen corresponding path program 812 times [2020-02-10 20:23:18,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:18,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909709856] [2020-02-10 20:23:18,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:18,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909709856] [2020-02-10 20:23:18,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:18,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:18,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452004173] [2020-02-10 20:23:18,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:18,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:18,644 INFO L87 Difference]: Start difference. First operand 1591 states and 7086 transitions. Second operand 11 states. [2020-02-10 20:23:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:18,904 INFO L93 Difference]: Finished difference Result 3004 states and 11813 transitions. [2020-02-10 20:23:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:18,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:18,911 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 20:23:18,911 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:23:18,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:23:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1581. [2020-02-10 20:23:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:23:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7060 transitions. [2020-02-10 20:23:18,974 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7060 transitions. Word has length 28 [2020-02-10 20:23:18,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:18,974 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7060 transitions. [2020-02-10 20:23:18,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7060 transitions. [2020-02-10 20:23:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:18,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:18,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:18,977 INFO L427 AbstractCegarLoop]: === Iteration 821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:18,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2077451868, now seen corresponding path program 813 times [2020-02-10 20:23:18,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:18,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397424890] [2020-02-10 20:23:18,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:19,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397424890] [2020-02-10 20:23:19,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:19,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:19,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221510033] [2020-02-10 20:23:19,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:19,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:19,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:19,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:19,521 INFO L87 Difference]: Start difference. First operand 1581 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:23:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:19,688 INFO L93 Difference]: Finished difference Result 3003 states and 11810 transitions. [2020-02-10 20:23:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:19,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:19,696 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:23:19,696 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:23:19,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:23:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1589. [2020-02-10 20:23:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 20:23:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7074 transitions. [2020-02-10 20:23:19,762 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7074 transitions. Word has length 28 [2020-02-10 20:23:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:19,763 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7074 transitions. [2020-02-10 20:23:19,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7074 transitions. [2020-02-10 20:23:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:19,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:19,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:19,765 INFO L427 AbstractCegarLoop]: === Iteration 822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:19,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1904204176, now seen corresponding path program 814 times [2020-02-10 20:23:19,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:19,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6724019] [2020-02-10 20:23:19,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:20,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6724019] [2020-02-10 20:23:20,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:20,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:20,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60273125] [2020-02-10 20:23:20,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:20,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:20,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:20,304 INFO L87 Difference]: Start difference. First operand 1589 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:23:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:20,498 INFO L93 Difference]: Finished difference Result 3000 states and 11797 transitions. [2020-02-10 20:23:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:20,499 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:20,506 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 20:23:20,506 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:23:20,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:23:20,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1581. [2020-02-10 20:23:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:23:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7052 transitions. [2020-02-10 20:23:20,570 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7052 transitions. Word has length 28 [2020-02-10 20:23:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:20,570 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7052 transitions. [2020-02-10 20:23:20,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7052 transitions. [2020-02-10 20:23:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:20,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:20,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:20,572 INFO L427 AbstractCegarLoop]: === Iteration 823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash 278191588, now seen corresponding path program 815 times [2020-02-10 20:23:20,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:20,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567653445] [2020-02-10 20:23:20,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:21,106 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:23:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:21,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567653445] [2020-02-10 20:23:21,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:21,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:21,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170640642] [2020-02-10 20:23:21,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:21,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:21,113 INFO L87 Difference]: Start difference. First operand 1581 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:23:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:21,311 INFO L93 Difference]: Finished difference Result 2998 states and 11794 transitions. [2020-02-10 20:23:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:21,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:21,319 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:23:21,319 INFO L226 Difference]: Without dead ends: 2980 [2020-02-10 20:23:21,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2020-02-10 20:23:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1588. [2020-02-10 20:23:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:23:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7065 transitions. [2020-02-10 20:23:21,385 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7065 transitions. Word has length 28 [2020-02-10 20:23:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:21,385 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7065 transitions. [2020-02-10 20:23:21,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7065 transitions. [2020-02-10 20:23:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:21,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:21,388 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:21,388 INFO L427 AbstractCegarLoop]: === Iteration 824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:21,388 INFO L82 PathProgramCache]: Analyzing trace with hash -293263218, now seen corresponding path program 816 times [2020-02-10 20:23:21,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:21,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496139893] [2020-02-10 20:23:21,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:21,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496139893] [2020-02-10 20:23:21,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:21,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:21,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196273996] [2020-02-10 20:23:21,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:21,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:21,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:21,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:21,926 INFO L87 Difference]: Start difference. First operand 1588 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:23:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:22,191 INFO L93 Difference]: Finished difference Result 2997 states and 11785 transitions. [2020-02-10 20:23:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:22,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:22,199 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 20:23:22,200 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 20:23:22,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 20:23:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1563. [2020-02-10 20:23:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:23:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7013 transitions. [2020-02-10 20:23:22,264 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7013 transitions. Word has length 28 [2020-02-10 20:23:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:22,264 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7013 transitions. [2020-02-10 20:23:22,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7013 transitions. [2020-02-10 20:23:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:22,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:22,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:22,267 INFO L427 AbstractCegarLoop]: === Iteration 825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:22,267 INFO L82 PathProgramCache]: Analyzing trace with hash -969642016, now seen corresponding path program 817 times [2020-02-10 20:23:22,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:22,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578895032] [2020-02-10 20:23:22,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:22,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578895032] [2020-02-10 20:23:22,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:22,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:22,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468185740] [2020-02-10 20:23:22,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:22,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:22,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:22,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:22,835 INFO L87 Difference]: Start difference. First operand 1563 states and 7013 transitions. Second operand 11 states. [2020-02-10 20:23:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:23,008 INFO L93 Difference]: Finished difference Result 3001 states and 11833 transitions. [2020-02-10 20:23:23,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:23,008 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:23,015 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:23:23,016 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:23:23,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:23:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1588. [2020-02-10 20:23:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:23:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7093 transitions. [2020-02-10 20:23:23,080 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7093 transitions. Word has length 28 [2020-02-10 20:23:23,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:23,080 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7093 transitions. [2020-02-10 20:23:23,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7093 transitions. [2020-02-10 20:23:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:23,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:23,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:23,082 INFO L427 AbstractCegarLoop]: === Iteration 826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:23,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash -224939518, now seen corresponding path program 818 times [2020-02-10 20:23:23,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:23,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46612254] [2020-02-10 20:23:23,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:23,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46612254] [2020-02-10 20:23:23,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:23,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:23,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595185983] [2020-02-10 20:23:23,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:23,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:23,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:23,633 INFO L87 Difference]: Start difference. First operand 1588 states and 7093 transitions. Second operand 11 states. [2020-02-10 20:23:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:23,768 INFO L93 Difference]: Finished difference Result 3005 states and 11834 transitions. [2020-02-10 20:23:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:23,768 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:23,776 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:23:23,776 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:23:23,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:23:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1581. [2020-02-10 20:23:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:23:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7073 transitions. [2020-02-10 20:23:23,842 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7073 transitions. Word has length 28 [2020-02-10 20:23:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:23,842 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7073 transitions. [2020-02-10 20:23:23,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7073 transitions. [2020-02-10 20:23:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:23,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:23,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:23,845 INFO L427 AbstractCegarLoop]: === Iteration 827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash 641298942, now seen corresponding path program 819 times [2020-02-10 20:23:23,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:23,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297294090] [2020-02-10 20:23:23,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:24,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297294090] [2020-02-10 20:23:24,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:24,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:24,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103785413] [2020-02-10 20:23:24,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:24,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:24,375 INFO L87 Difference]: Start difference. First operand 1581 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:23:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:24,548 INFO L93 Difference]: Finished difference Result 2998 states and 11821 transitions. [2020-02-10 20:23:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:24,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:24,556 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:23:24,556 INFO L226 Difference]: Without dead ends: 2982 [2020-02-10 20:23:24,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2020-02-10 20:23:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1587. [2020-02-10 20:23:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:23:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7084 transitions. [2020-02-10 20:23:24,621 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7084 transitions. Word has length 28 [2020-02-10 20:23:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:24,621 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7084 transitions. [2020-02-10 20:23:24,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7084 transitions. [2020-02-10 20:23:24,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:24,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:24,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:24,624 INFO L427 AbstractCegarLoop]: === Iteration 828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:24,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2130703938, now seen corresponding path program 820 times [2020-02-10 20:23:24,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:24,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235789665] [2020-02-10 20:23:24,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:25,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235789665] [2020-02-10 20:23:25,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:25,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:25,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512303198] [2020-02-10 20:23:25,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:25,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:25,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:25,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:25,153 INFO L87 Difference]: Start difference. First operand 1587 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:23:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:25,353 INFO L93 Difference]: Finished difference Result 3000 states and 11819 transitions. [2020-02-10 20:23:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:25,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:25,361 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 20:23:25,361 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:23:25,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:23:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1581. [2020-02-10 20:23:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:23:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7067 transitions. [2020-02-10 20:23:25,425 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7067 transitions. Word has length 28 [2020-02-10 20:23:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:25,425 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7067 transitions. [2020-02-10 20:23:25,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7067 transitions. [2020-02-10 20:23:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:25,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:25,427 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:25,428 INFO L427 AbstractCegarLoop]: === Iteration 829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1298024898, now seen corresponding path program 821 times [2020-02-10 20:23:25,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:25,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231763452] [2020-02-10 20:23:25,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:25,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231763452] [2020-02-10 20:23:25,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:25,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:25,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182986696] [2020-02-10 20:23:25,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:25,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:25,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:25,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:25,979 INFO L87 Difference]: Start difference. First operand 1581 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:23:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:26,105 INFO L93 Difference]: Finished difference Result 3010 states and 11838 transitions. [2020-02-10 20:23:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:26,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:26,113 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 20:23:26,113 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 20:23:26,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:26,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 20:23:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1591. [2020-02-10 20:23:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:23:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7084 transitions. [2020-02-10 20:23:26,177 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7084 transitions. Word has length 28 [2020-02-10 20:23:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:26,177 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7084 transitions. [2020-02-10 20:23:26,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7084 transitions. [2020-02-10 20:23:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:26,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:26,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:26,180 INFO L427 AbstractCegarLoop]: === Iteration 830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash -553322400, now seen corresponding path program 822 times [2020-02-10 20:23:26,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:26,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393061256] [2020-02-10 20:23:26,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:26,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393061256] [2020-02-10 20:23:26,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:26,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:26,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728811008] [2020-02-10 20:23:26,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:26,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:26,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:26,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:26,736 INFO L87 Difference]: Start difference. First operand 1591 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:23:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:26,904 INFO L93 Difference]: Finished difference Result 3008 states and 11826 transitions. [2020-02-10 20:23:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:26,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:26,912 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 20:23:26,912 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 20:23:26,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 20:23:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1573. [2020-02-10 20:23:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:23:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 20:23:26,977 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 20:23:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:26,977 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 20:23:26,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 20:23:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:26,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:26,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:26,980 INFO L427 AbstractCegarLoop]: === Iteration 831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash -381896694, now seen corresponding path program 823 times [2020-02-10 20:23:26,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:26,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188713791] [2020-02-10 20:23:26,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:27,511 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:23:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:27,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188713791] [2020-02-10 20:23:27,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:27,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:27,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110864650] [2020-02-10 20:23:27,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:27,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:27,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:27,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:27,519 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:23:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:27,694 INFO L93 Difference]: Finished difference Result 2997 states and 11817 transitions. [2020-02-10 20:23:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:27,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:27,702 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 20:23:27,703 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:23:27,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:23:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1587. [2020-02-10 20:23:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:23:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7083 transitions. [2020-02-10 20:23:27,766 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7083 transitions. Word has length 28 [2020-02-10 20:23:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:27,767 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7083 transitions. [2020-02-10 20:23:27,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7083 transitions. [2020-02-10 20:23:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:27,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:27,769 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:27,769 INFO L427 AbstractCegarLoop]: === Iteration 832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:27,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:27,769 INFO L82 PathProgramCache]: Analyzing trace with hash 362805804, now seen corresponding path program 824 times [2020-02-10 20:23:27,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:27,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91478887] [2020-02-10 20:23:27,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:28,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91478887] [2020-02-10 20:23:28,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:28,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:28,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032450833] [2020-02-10 20:23:28,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:28,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:28,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:28,311 INFO L87 Difference]: Start difference. First operand 1587 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:23:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:28,451 INFO L93 Difference]: Finished difference Result 3001 states and 11818 transitions. [2020-02-10 20:23:28,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:28,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:28,459 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:23:28,459 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:23:28,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:23:28,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1580. [2020-02-10 20:23:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:23:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7063 transitions. [2020-02-10 20:23:28,551 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7063 transitions. Word has length 28 [2020-02-10 20:23:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:28,551 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7063 transitions. [2020-02-10 20:23:28,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7063 transitions. [2020-02-10 20:23:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:28,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:28,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, 1, 1, 1] [2020-02-10 20:23:28,554 INFO L427 AbstractCegarLoop]: === Iteration 833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:28,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:28,555 INFO L82 PathProgramCache]: Analyzing trace with hash 693814462, now seen corresponding path program 825 times [2020-02-10 20:23:28,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:28,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138691554] [2020-02-10 20:23:28,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:29,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138691554] [2020-02-10 20:23:29,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:29,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:29,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771066087] [2020-02-10 20:23:29,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:29,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:29,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:29,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:29,095 INFO L87 Difference]: Start difference. First operand 1580 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:23:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:29,259 INFO L93 Difference]: Finished difference Result 2993 states and 11803 transitions. [2020-02-10 20:23:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:29,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:29,267 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:23:29,267 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 20:23:29,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 20:23:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1586. [2020-02-10 20:23:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:23:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7074 transitions. [2020-02-10 20:23:29,332 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7074 transitions. Word has length 28 [2020-02-10 20:23:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:29,333 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7074 transitions. [2020-02-10 20:23:29,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7074 transitions. [2020-02-10 20:23:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:29,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:29,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:29,335 INFO L427 AbstractCegarLoop]: === Iteration 834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:29,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:29,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1611764652, now seen corresponding path program 826 times [2020-02-10 20:23:29,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:29,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966937122] [2020-02-10 20:23:29,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:29,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966937122] [2020-02-10 20:23:29,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:29,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:29,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86101546] [2020-02-10 20:23:29,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:29,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:29,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:29,872 INFO L87 Difference]: Start difference. First operand 1586 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:23:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:30,038 INFO L93 Difference]: Finished difference Result 2994 states and 11799 transitions. [2020-02-10 20:23:30,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:30,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:30,045 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 20:23:30,045 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:23:30,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:23:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1580. [2020-02-10 20:23:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:23:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7057 transitions. [2020-02-10 20:23:30,110 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7057 transitions. Word has length 28 [2020-02-10 20:23:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:30,111 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7057 transitions. [2020-02-10 20:23:30,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7057 transitions. [2020-02-10 20:23:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:30,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:30,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:30,113 INFO L427 AbstractCegarLoop]: === Iteration 835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1245509378, now seen corresponding path program 827 times [2020-02-10 20:23:30,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:30,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083793292] [2020-02-10 20:23:30,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:30,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083793292] [2020-02-10 20:23:30,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:30,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:30,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550367382] [2020-02-10 20:23:30,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:30,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:30,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:30,653 INFO L87 Difference]: Start difference. First operand 1580 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:23:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:30,800 INFO L93 Difference]: Finished difference Result 3003 states and 11816 transitions. [2020-02-10 20:23:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:30,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:30,807 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:23:30,807 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:23:30,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:23:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1588. [2020-02-10 20:23:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:23:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7071 transitions. [2020-02-10 20:23:30,872 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7071 transitions. Word has length 28 [2020-02-10 20:23:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:30,872 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7071 transitions. [2020-02-10 20:23:30,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7071 transitions. [2020-02-10 20:23:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:30,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:30,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:30,875 INFO L427 AbstractCegarLoop]: === Iteration 836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:30,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1072261686, now seen corresponding path program 828 times [2020-02-10 20:23:30,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:30,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271585068] [2020-02-10 20:23:30,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:31,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271585068] [2020-02-10 20:23:31,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:31,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:31,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904882749] [2020-02-10 20:23:31,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:31,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:31,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:31,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:31,420 INFO L87 Difference]: Start difference. First operand 1588 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:23:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:31,626 INFO L93 Difference]: Finished difference Result 3000 states and 11803 transitions. [2020-02-10 20:23:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:31,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:31,633 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 20:23:31,633 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:23:31,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:23:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1573. [2020-02-10 20:23:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:23:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7037 transitions. [2020-02-10 20:23:31,699 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7037 transitions. Word has length 28 [2020-02-10 20:23:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:31,699 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7037 transitions. [2020-02-10 20:23:31,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7037 transitions. [2020-02-10 20:23:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:31,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:31,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:31,702 INFO L427 AbstractCegarLoop]: === Iteration 837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:31,702 INFO L82 PathProgramCache]: Analyzing trace with hash -371393590, now seen corresponding path program 829 times [2020-02-10 20:23:31,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:31,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713372957] [2020-02-10 20:23:31,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:32,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713372957] [2020-02-10 20:23:32,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:32,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:32,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191361003] [2020-02-10 20:23:32,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:32,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:32,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:32,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:32,249 INFO L87 Difference]: Start difference. First operand 1573 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:23:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:32,477 INFO L93 Difference]: Finished difference Result 2989 states and 11795 transitions. [2020-02-10 20:23:32,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:32,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:32,485 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:23:32,485 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 20:23:32,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 20:23:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1585. [2020-02-10 20:23:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:23:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7071 transitions. [2020-02-10 20:23:32,552 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7071 transitions. Word has length 28 [2020-02-10 20:23:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:32,552 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7071 transitions. [2020-02-10 20:23:32,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7071 transitions. [2020-02-10 20:23:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:32,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:32,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, 1, 1, 1] [2020-02-10 20:23:32,554 INFO L427 AbstractCegarLoop]: === Iteration 838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:32,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1118011406, now seen corresponding path program 830 times [2020-02-10 20:23:32,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:32,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259442244] [2020-02-10 20:23:32,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:33,086 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:23:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:33,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259442244] [2020-02-10 20:23:33,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:33,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:33,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918310898] [2020-02-10 20:23:33,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:33,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:33,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:33,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:33,094 INFO L87 Difference]: Start difference. First operand 1585 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:23:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:33,273 INFO L93 Difference]: Finished difference Result 2991 states and 11793 transitions. [2020-02-10 20:23:33,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:33,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:33,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:33,280 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:23:33,280 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 20:23:33,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 20:23:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1579. [2020-02-10 20:23:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:23:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7054 transitions. [2020-02-10 20:23:33,345 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7054 transitions. Word has length 28 [2020-02-10 20:23:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:33,345 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7054 transitions. [2020-02-10 20:23:33,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7054 transitions. [2020-02-10 20:23:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:33,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:33,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:33,347 INFO L427 AbstractCegarLoop]: === Iteration 839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:33,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:33,348 INFO L82 PathProgramCache]: Analyzing trace with hash -906623392, now seen corresponding path program 831 times [2020-02-10 20:23:33,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:33,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143397856] [2020-02-10 20:23:33,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:33,887 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:23:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:33,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143397856] [2020-02-10 20:23:33,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:33,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:33,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270453075] [2020-02-10 20:23:33,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:33,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:33,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:33,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:33,895 INFO L87 Difference]: Start difference. First operand 1579 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:23:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:34,069 INFO L93 Difference]: Finished difference Result 2988 states and 11787 transitions. [2020-02-10 20:23:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:34,070 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:34,078 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:23:34,078 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 20:23:34,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 20:23:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1585. [2020-02-10 20:23:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:23:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7065 transitions. [2020-02-10 20:23:34,143 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7065 transitions. Word has length 28 [2020-02-10 20:23:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:34,143 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7065 transitions. [2020-02-10 20:23:34,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7065 transitions. [2020-02-10 20:23:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:34,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:34,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:34,146 INFO L427 AbstractCegarLoop]: === Iteration 840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:34,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash 11326798, now seen corresponding path program 832 times [2020-02-10 20:23:34,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:34,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545375275] [2020-02-10 20:23:34,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:34,700 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:23:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:34,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545375275] [2020-02-10 20:23:34,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:34,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:34,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691609622] [2020-02-10 20:23:34,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:34,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:34,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:34,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:34,709 INFO L87 Difference]: Start difference. First operand 1585 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:23:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:34,886 INFO L93 Difference]: Finished difference Result 2989 states and 11783 transitions. [2020-02-10 20:23:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:34,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:34,893 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:23:34,893 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:23:34,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:34,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:23:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1579. [2020-02-10 20:23:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:23:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7048 transitions. [2020-02-10 20:23:34,959 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7048 transitions. Word has length 28 [2020-02-10 20:23:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:34,959 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7048 transitions. [2020-02-10 20:23:34,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7048 transitions. [2020-02-10 20:23:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:34,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:34,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:34,961 INFO L427 AbstractCegarLoop]: === Iteration 841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:34,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash -490303776, now seen corresponding path program 833 times [2020-02-10 20:23:34,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:34,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151576066] [2020-02-10 20:23:34,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:35,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151576066] [2020-02-10 20:23:35,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:35,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:35,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555079487] [2020-02-10 20:23:35,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:35,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:35,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:35,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:35,493 INFO L87 Difference]: Start difference. First operand 1579 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:23:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:35,658 INFO L93 Difference]: Finished difference Result 2993 states and 11792 transitions. [2020-02-10 20:23:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:35,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:35,665 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:23:35,665 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:23:35,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:23:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1586. [2020-02-10 20:23:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:23:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7061 transitions. [2020-02-10 20:23:35,731 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7061 transitions. Word has length 28 [2020-02-10 20:23:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:35,731 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7061 transitions. [2020-02-10 20:23:35,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7061 transitions. [2020-02-10 20:23:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:35,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:35,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:35,734 INFO L427 AbstractCegarLoop]: === Iteration 842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1061758582, now seen corresponding path program 834 times [2020-02-10 20:23:35,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:35,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926231681] [2020-02-10 20:23:35,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:36,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-02-10 20:23:36,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926231681] [2020-02-10 20:23:36,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:36,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:36,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327825177] [2020-02-10 20:23:36,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:36,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:36,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:36,270 INFO L87 Difference]: Start difference. First operand 1586 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:23:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:36,440 INFO L93 Difference]: Finished difference Result 2992 states and 11783 transitions. [2020-02-10 20:23:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:36,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:36,448 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:23:36,448 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:23:36,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:23:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1573. [2020-02-10 20:23:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:23:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7031 transitions. [2020-02-10 20:23:36,512 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7031 transitions. Word has length 28 [2020-02-10 20:23:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:36,512 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7031 transitions. [2020-02-10 20:23:36,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7031 transitions. [2020-02-10 20:23:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:36,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:36,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:36,515 INFO L427 AbstractCegarLoop]: === Iteration 843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:36,515 INFO L82 PathProgramCache]: Analyzing trace with hash 383812012, now seen corresponding path program 835 times [2020-02-10 20:23:36,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:36,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576481317] [2020-02-10 20:23:36,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:37,073 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:23:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:37,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576481317] [2020-02-10 20:23:37,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:37,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:37,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123497497] [2020-02-10 20:23:37,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:37,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:37,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:37,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:37,081 INFO L87 Difference]: Start difference. First operand 1573 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:23:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:37,247 INFO L93 Difference]: Finished difference Result 3015 states and 11843 transitions. [2020-02-10 20:23:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:37,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:37,255 INFO L225 Difference]: With dead ends: 3015 [2020-02-10 20:23:37,255 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:23:37,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:23:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1593. [2020-02-10 20:23:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 20:23:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7081 transitions. [2020-02-10 20:23:37,321 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7081 transitions. Word has length 28 [2020-02-10 20:23:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:37,321 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7081 transitions. [2020-02-10 20:23:37,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7081 transitions. [2020-02-10 20:23:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:37,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:37,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:37,323 INFO L427 AbstractCegarLoop]: === Iteration 844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:37,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1128514510, now seen corresponding path program 836 times [2020-02-10 20:23:37,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:37,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818433474] [2020-02-10 20:23:37,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23: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-02-10 20:23:37,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818433474] [2020-02-10 20:23:37,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:37,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:37,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845390967] [2020-02-10 20:23:37,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:37,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:37,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:37,881 INFO L87 Difference]: Start difference. First operand 1593 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:23:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:38,054 INFO L93 Difference]: Finished difference Result 3013 states and 11831 transitions. [2020-02-10 20:23:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:38,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:38,062 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 20:23:38,062 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:23:38,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:23:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1583. [2020-02-10 20:23:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:23:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7055 transitions. [2020-02-10 20:23:38,127 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7055 transitions. Word has length 28 [2020-02-10 20:23:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:38,128 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7055 transitions. [2020-02-10 20:23:38,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7055 transitions. [2020-02-10 20:23:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:38,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:38,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:38,130 INFO L427 AbstractCegarLoop]: === Iteration 845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash -151417790, now seen corresponding path program 837 times [2020-02-10 20:23:38,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:38,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705887689] [2020-02-10 20:23:38,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:38,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705887689] [2020-02-10 20:23:38,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:38,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:38,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502589007] [2020-02-10 20:23:38,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:38,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:38,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:38,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:38,681 INFO L87 Difference]: Start difference. First operand 1583 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:23:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:38,824 INFO L93 Difference]: Finished difference Result 3012 states and 11828 transitions. [2020-02-10 20:23:38,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:38,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:38,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:38,832 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:23:38,833 INFO L226 Difference]: Without dead ends: 2992 [2020-02-10 20:23:38,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-02-10 20:23:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1591. [2020-02-10 20:23:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:23:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7069 transitions. [2020-02-10 20:23:38,897 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7069 transitions. Word has length 28 [2020-02-10 20:23:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:38,897 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7069 transitions. [2020-02-10 20:23:38,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7069 transitions. [2020-02-10 20:23:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:38,899 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:38,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, 1, 1, 1] [2020-02-10 20:23:38,900 INFO L427 AbstractCegarLoop]: === Iteration 846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:38,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:38,900 INFO L82 PathProgramCache]: Analyzing trace with hash 21829902, now seen corresponding path program 838 times [2020-02-10 20:23:38,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:38,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700946892] [2020-02-10 20:23:38,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:39,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700946892] [2020-02-10 20:23:39,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:39,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:39,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842322664] [2020-02-10 20:23:39,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:39,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:39,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:39,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:39,446 INFO L87 Difference]: Start difference. First operand 1591 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:23:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:39,610 INFO L93 Difference]: Finished difference Result 3009 states and 11815 transitions. [2020-02-10 20:23:39,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:39,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:39,618 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:23:39,618 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 20:23:39,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 20:23:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1583. [2020-02-10 20:23:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:23:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7047 transitions. [2020-02-10 20:23:39,681 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7047 transitions. Word has length 28 [2020-02-10 20:23:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:39,682 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7047 transitions. [2020-02-10 20:23:39,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7047 transitions. [2020-02-10 20:23:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:39,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:39,684 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:39,684 INFO L427 AbstractCegarLoop]: === Iteration 847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2090741630, now seen corresponding path program 839 times [2020-02-10 20:23:39,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:39,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905213920] [2020-02-10 20:23:39,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:40,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905213920] [2020-02-10 20:23:40,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:40,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:40,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888481907] [2020-02-10 20:23:40,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:40,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:40,231 INFO L87 Difference]: Start difference. First operand 1583 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:23:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:40,423 INFO L93 Difference]: Finished difference Result 3007 states and 11812 transitions. [2020-02-10 20:23:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:40,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:40,431 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 20:23:40,431 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:23:40,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:23:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1590. [2020-02-10 20:23:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:23:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7060 transitions. [2020-02-10 20:23:40,495 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7060 transitions. Word has length 28 [2020-02-10 20:23:40,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:40,495 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7060 transitions. [2020-02-10 20:23:40,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7060 transitions. [2020-02-10 20:23:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:40,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:40,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:40,498 INFO L427 AbstractCegarLoop]: === Iteration 848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1632770860, now seen corresponding path program 840 times [2020-02-10 20:23:40,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:40,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051290755] [2020-02-10 20:23:40,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:41,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051290755] [2020-02-10 20:23:41,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:41,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:41,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635342651] [2020-02-10 20:23:41,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:41,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:41,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:41,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:41,063 INFO L87 Difference]: Start difference. First operand 1590 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:23:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:41,237 INFO L93 Difference]: Finished difference Result 3006 states and 11803 transitions. [2020-02-10 20:23:41,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:41,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:41,244 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:23:41,245 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:23:41,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:23:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1553. [2020-02-10 20:23:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2020-02-10 20:23:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 6987 transitions. [2020-02-10 20:23:41,307 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 6987 transitions. Word has length 28 [2020-02-10 20:23:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:41,308 INFO L479 AbstractCegarLoop]: Abstraction has 1553 states and 6987 transitions. [2020-02-10 20:23:41,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 6987 transitions. [2020-02-10 20:23:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:41,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:41,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:41,310 INFO L427 AbstractCegarLoop]: === Iteration 849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:41,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:41,310 INFO L82 PathProgramCache]: Analyzing trace with hash -471497986, now seen corresponding path program 841 times [2020-02-10 20:23:41,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:41,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392190485] [2020-02-10 20:23:41,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:41,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392190485] [2020-02-10 20:23:41,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:41,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:41,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090004784] [2020-02-10 20:23:41,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:41,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:41,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:41,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:41,836 INFO L87 Difference]: Start difference. First operand 1553 states and 6987 transitions. Second operand 11 states. [2020-02-10 20:23:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:42,014 INFO L93 Difference]: Finished difference Result 2917 states and 11586 transitions. [2020-02-10 20:23:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:42,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:42,021 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:23:42,021 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 20:23:42,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 20:23:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1576. [2020-02-10 20:23:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:23:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7075 transitions. [2020-02-10 20:23:42,085 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7075 transitions. Word has length 28 [2020-02-10 20:23:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:42,085 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7075 transitions. [2020-02-10 20:23:42,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7075 transitions. [2020-02-10 20:23:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:42,087 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:42,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:42,088 INFO L427 AbstractCegarLoop]: === Iteration 850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:42,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:42,088 INFO L82 PathProgramCache]: Analyzing trace with hash 273204512, now seen corresponding path program 842 times [2020-02-10 20:23:42,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:42,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770512046] [2020-02-10 20:23:42,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:42,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770512046] [2020-02-10 20:23:42,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:42,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:42,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168374985] [2020-02-10 20:23:42,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:42,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:42,612 INFO L87 Difference]: Start difference. First operand 1576 states and 7075 transitions. Second operand 11 states. [2020-02-10 20:23:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:42,796 INFO L93 Difference]: Finished difference Result 2918 states and 11583 transitions. [2020-02-10 20:23:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:42,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:42,804 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 20:23:42,804 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 20:23:42,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 20:23:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1571. [2020-02-10 20:23:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:23:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7061 transitions. [2020-02-10 20:23:42,867 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7061 transitions. Word has length 28 [2020-02-10 20:23:42,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:42,867 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7061 transitions. [2020-02-10 20:23:42,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7061 transitions. [2020-02-10 20:23:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:42,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:42,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:42,870 INFO L427 AbstractCegarLoop]: === Iteration 851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1139442972, now seen corresponding path program 843 times [2020-02-10 20:23:42,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:42,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697921583] [2020-02-10 20:23:42,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:43,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697921583] [2020-02-10 20:23:43,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:43,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:43,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235915289] [2020-02-10 20:23:43,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:43,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:43,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:43,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:43,376 INFO L87 Difference]: Start difference. First operand 1571 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:23:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:43,575 INFO L93 Difference]: Finished difference Result 2922 states and 11590 transitions. [2020-02-10 20:23:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:43,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:43,583 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:23:43,583 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:23:43,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:23:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1577. [2020-02-10 20:23:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:23:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7072 transitions. [2020-02-10 20:23:43,647 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7072 transitions. Word has length 28 [2020-02-10 20:23:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:43,647 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7072 transitions. [2020-02-10 20:23:43,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7072 transitions. [2020-02-10 20:23:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:43,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:43,650 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:43,650 INFO L427 AbstractCegarLoop]: === Iteration 852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1666119328, now seen corresponding path program 844 times [2020-02-10 20:23:43,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:43,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253876002] [2020-02-10 20:23:43,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:44,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253876002] [2020-02-10 20:23:44,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:44,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:44,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609902963] [2020-02-10 20:23:44,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:44,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:44,180 INFO L87 Difference]: Start difference. First operand 1577 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:23:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:44,327 INFO L93 Difference]: Finished difference Result 2927 states and 11594 transitions. [2020-02-10 20:23:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:44,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:44,334 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:23:44,334 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:23:44,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:23:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1571. [2020-02-10 20:23:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:23:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7055 transitions. [2020-02-10 20:23:44,398 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7055 transitions. Word has length 28 [2020-02-10 20:23:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:44,398 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7055 transitions. [2020-02-10 20:23:44,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7055 transitions. [2020-02-10 20:23:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:44,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:44,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:44,400 INFO L427 AbstractCegarLoop]: === Iteration 853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:44,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:44,401 INFO L82 PathProgramCache]: Analyzing trace with hash -799880868, now seen corresponding path program 845 times [2020-02-10 20:23:44,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:44,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620051336] [2020-02-10 20:23:44,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:44,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620051336] [2020-02-10 20:23:44,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:44,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:44,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706517158] [2020-02-10 20:23:44,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:44,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:44,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:44,932 INFO L87 Difference]: Start difference. First operand 1571 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:23:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:45,105 INFO L93 Difference]: Finished difference Result 2925 states and 11591 transitions. [2020-02-10 20:23:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:45,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:45,112 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:23:45,113 INFO L226 Difference]: Without dead ends: 2909 [2020-02-10 20:23:45,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2020-02-10 20:23:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1578. [2020-02-10 20:23:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:23:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 20:23:45,177 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 20:23:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:45,177 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 20:23:45,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 20:23:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:45,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:45,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:45,179 INFO L427 AbstractCegarLoop]: === Iteration 854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash -55178370, now seen corresponding path program 846 times [2020-02-10 20:23:45,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:45,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027183189] [2020-02-10 20:23:45,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:45,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027183189] [2020-02-10 20:23:45,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:45,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:45,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368798407] [2020-02-10 20:23:45,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:45,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:45,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:45,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:45,739 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:23:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:45,884 INFO L93 Difference]: Finished difference Result 2929 states and 11592 transitions. [2020-02-10 20:23:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:45,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:45,891 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:23:45,891 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:23:45,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:45,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:23:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1565. [2020-02-10 20:23:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:23:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7038 transitions. [2020-02-10 20:23:45,955 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7038 transitions. Word has length 28 [2020-02-10 20:23:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:45,955 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7038 transitions. [2020-02-10 20:23:45,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7038 transitions. [2020-02-10 20:23:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:45,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:45,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:45,957 INFO L427 AbstractCegarLoop]: === Iteration 855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:45,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:45,957 INFO L82 PathProgramCache]: Analyzing trace with hash 248514488, now seen corresponding path program 847 times [2020-02-10 20:23:45,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:45,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237464835] [2020-02-10 20:23:45,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:46,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237464835] [2020-02-10 20:23:46,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:46,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:46,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463959122] [2020-02-10 20:23:46,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:46,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:46,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:46,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:46,467 INFO L87 Difference]: Start difference. First operand 1565 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:23:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:46,674 INFO L93 Difference]: Finished difference Result 2912 states and 11570 transitions. [2020-02-10 20:23:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:46,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:46,682 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:23:46,683 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 20:23:46,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:46,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 20:23:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1575. [2020-02-10 20:23:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:23:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7066 transitions. [2020-02-10 20:23:46,747 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7066 transitions. Word has length 28 [2020-02-10 20:23:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:46,747 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7066 transitions. [2020-02-10 20:23:46,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7066 transitions. [2020-02-10 20:23:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:46,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:46,750 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:46,750 INFO L427 AbstractCegarLoop]: === Iteration 856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:46,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:46,750 INFO L82 PathProgramCache]: Analyzing trace with hash 993216986, now seen corresponding path program 848 times [2020-02-10 20:23:46,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:46,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679270356] [2020-02-10 20:23:46,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:47,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679270356] [2020-02-10 20:23:47,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:47,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:47,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658040831] [2020-02-10 20:23:47,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:47,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:47,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:47,278 INFO L87 Difference]: Start difference. First operand 1575 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:23:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:47,486 INFO L93 Difference]: Finished difference Result 2913 states and 11567 transitions. [2020-02-10 20:23:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:47,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:47,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:47,493 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 20:23:47,493 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 20:23:47,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 20:23:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1570. [2020-02-10 20:23:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:23:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 20:23:47,557 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 20:23:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:47,558 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 20:23:47,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 20:23:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:47,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:47,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, 1, 1, 1] [2020-02-10 20:23:47,560 INFO L427 AbstractCegarLoop]: === Iteration 857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:47,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash -824570892, now seen corresponding path program 849 times [2020-02-10 20:23:47,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:47,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127280653] [2020-02-10 20:23:47,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:48,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127280653] [2020-02-10 20:23:48,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:48,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:48,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902000833] [2020-02-10 20:23:48,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:48,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:48,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:48,070 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:23:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:48,334 INFO L93 Difference]: Finished difference Result 2914 states and 11569 transitions. [2020-02-10 20:23:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:48,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:48,341 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:23:48,341 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:23:48,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:23:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1575. [2020-02-10 20:23:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:23:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7061 transitions. [2020-02-10 20:23:48,406 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7061 transitions. Word has length 28 [2020-02-10 20:23:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:48,407 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7061 transitions. [2020-02-10 20:23:48,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7061 transitions. [2020-02-10 20:23:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:48,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:48,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:48,409 INFO L427 AbstractCegarLoop]: === Iteration 858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:48,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1409536602, now seen corresponding path program 850 times [2020-02-10 20:23:48,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:48,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832598027] [2020-02-10 20:23:48,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:48,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832598027] [2020-02-10 20:23:48,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:48,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:48,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187600139] [2020-02-10 20:23:48,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:48,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:48,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:48,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:48,912 INFO L87 Difference]: Start difference. First operand 1575 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:23:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:49,109 INFO L93 Difference]: Finished difference Result 2917 states and 11570 transitions. [2020-02-10 20:23:49,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:49,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:49,117 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:23:49,117 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 20:23:49,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 20:23:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1570. [2020-02-10 20:23:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:23:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7047 transitions. [2020-02-10 20:23:49,180 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7047 transitions. Word has length 28 [2020-02-10 20:23:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:49,180 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7047 transitions. [2020-02-10 20:23:49,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7047 transitions. [2020-02-10 20:23:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:49,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:49,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:49,182 INFO L427 AbstractCegarLoop]: === Iteration 859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1531072564, now seen corresponding path program 851 times [2020-02-10 20:23:49,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:49,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94397312] [2020-02-10 20:23:49,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:49,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94397312] [2020-02-10 20:23:49,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:49,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:49,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877842775] [2020-02-10 20:23:49,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:49,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:49,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:49,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:49,720 INFO L87 Difference]: Start difference. First operand 1570 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:23:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:49,931 INFO L93 Difference]: Finished difference Result 2917 states and 11571 transitions. [2020-02-10 20:23:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:49,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:49,939 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:23:49,939 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:23:49,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:23:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1576. [2020-02-10 20:23:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:23:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7058 transitions. [2020-02-10 20:23:50,004 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7058 transitions. Word has length 28 [2020-02-10 20:23:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:50,004 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7058 transitions. [2020-02-10 20:23:50,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7058 transitions. [2020-02-10 20:23:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:50,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:50,007 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:50,007 INFO L427 AbstractCegarLoop]: === Iteration 860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:50,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:50,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1274489736, now seen corresponding path program 852 times [2020-02-10 20:23:50,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:50,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725191487] [2020-02-10 20:23:50,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:50,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725191487] [2020-02-10 20:23:50,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:50,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:50,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297882964] [2020-02-10 20:23:50,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:50,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:50,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:50,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:50,516 INFO L87 Difference]: Start difference. First operand 1576 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:23:50,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:50,722 INFO L93 Difference]: Finished difference Result 2919 states and 11569 transitions. [2020-02-10 20:23:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:50,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:50,730 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:23:50,730 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:23:50,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:50,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:23:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1565. [2020-02-10 20:23:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:23:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7033 transitions. [2020-02-10 20:23:50,793 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7033 transitions. Word has length 28 [2020-02-10 20:23:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:50,793 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7033 transitions. [2020-02-10 20:23:50,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7033 transitions. [2020-02-10 20:23:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:50,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:50,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:50,795 INFO L427 AbstractCegarLoop]: === Iteration 861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:50,796 INFO L82 PathProgramCache]: Analyzing trace with hash 259017592, now seen corresponding path program 853 times [2020-02-10 20:23:50,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:50,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228613821] [2020-02-10 20:23:50,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:51,316 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2020-02-10 20:23:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:51,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228613821] [2020-02-10 20:23:51,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:51,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:51,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451415467] [2020-02-10 20:23:51,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:51,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:51,323 INFO L87 Difference]: Start difference. First operand 1565 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:23:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:51,535 INFO L93 Difference]: Finished difference Result 2928 states and 11597 transitions. [2020-02-10 20:23:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:51,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:51,542 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 20:23:51,543 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:23:51,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:23:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1578. [2020-02-10 20:23:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:23:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 20:23:51,606 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 20:23:51,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:51,606 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 20:23:51,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 20:23:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:51,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:51,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:51,609 INFO L427 AbstractCegarLoop]: === Iteration 862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:51,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1748422588, now seen corresponding path program 854 times [2020-02-10 20:23:51,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:51,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208792736] [2020-02-10 20:23:51,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:52,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208792736] [2020-02-10 20:23:52,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:52,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:52,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829326428] [2020-02-10 20:23:52,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:52,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:52,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:52,140 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:23:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:52,302 INFO L93 Difference]: Finished difference Result 2933 states and 11601 transitions. [2020-02-10 20:23:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:52,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:52,309 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:23:52,309 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:23:52,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:23:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1572. [2020-02-10 20:23:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:23:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7051 transitions. [2020-02-10 20:23:52,374 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7051 transitions. Word has length 28 [2020-02-10 20:23:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:52,374 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7051 transitions. [2020-02-10 20:23:52,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7051 transitions. [2020-02-10 20:23:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:52,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:52,377 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:52,377 INFO L427 AbstractCegarLoop]: === Iteration 863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:52,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1869958550, now seen corresponding path program 855 times [2020-02-10 20:23:52,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:52,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886023559] [2020-02-10 20:23:52,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:52,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886023559] [2020-02-10 20:23:52,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:52,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:52,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631622788] [2020-02-10 20:23:52,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:52,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:52,916 INFO L87 Difference]: Start difference. First operand 1572 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:23:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:53,138 INFO L93 Difference]: Finished difference Result 2925 states and 11586 transitions. [2020-02-10 20:23:53,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:53,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:53,145 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:23:53,145 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:23:53,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:23:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1577. [2020-02-10 20:23:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:23:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7060 transitions. [2020-02-10 20:23:53,209 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7060 transitions. Word has length 28 [2020-02-10 20:23:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:53,209 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7060 transitions. [2020-02-10 20:23:53,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7060 transitions. [2020-02-10 20:23:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:53,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:53,211 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:53,211 INFO L427 AbstractCegarLoop]: === Iteration 864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash -190901252, now seen corresponding path program 856 times [2020-02-10 20:23:53,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:53,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967543104] [2020-02-10 20:23:53,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:53,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967543104] [2020-02-10 20:23:53,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:53,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:53,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970465557] [2020-02-10 20:23:53,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:53,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:53,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:53,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:53,719 INFO L87 Difference]: Start difference. First operand 1577 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:23:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:53,909 INFO L93 Difference]: Finished difference Result 2928 states and 11587 transitions. [2020-02-10 20:23:53,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:53,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:53,918 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 20:23:53,918 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:23:53,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:23:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1572. [2020-02-10 20:23:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:23:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7046 transitions. [2020-02-10 20:23:53,983 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7046 transitions. Word has length 28 [2020-02-10 20:23:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:53,984 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7046 transitions. [2020-02-10 20:23:53,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7046 transitions. [2020-02-10 20:23:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:53,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:53,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:53,986 INFO L427 AbstractCegarLoop]: === Iteration 865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:53,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:53,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2008689130, now seen corresponding path program 857 times [2020-02-10 20:23:53,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:53,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283867236] [2020-02-10 20:23:53,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:54,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283867236] [2020-02-10 20:23:54,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:54,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:54,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508562160] [2020-02-10 20:23:54,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:54,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:54,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:54,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:54,523 INFO L87 Difference]: Start difference. First operand 1572 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:23:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:54,729 INFO L93 Difference]: Finished difference Result 2940 states and 11611 transitions. [2020-02-10 20:23:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:54,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:54,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:54,737 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:23:54,737 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:23:54,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:23:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1582. [2020-02-10 20:23:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:23:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7063 transitions. [2020-02-10 20:23:54,801 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7063 transitions. Word has length 28 [2020-02-10 20:23:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:54,801 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7063 transitions. [2020-02-10 20:23:54,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7063 transitions. [2020-02-10 20:23:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:54,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:54,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:54,803 INFO L427 AbstractCegarLoop]: === Iteration 866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:54,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1263986632, now seen corresponding path program 858 times [2020-02-10 20:23:54,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:54,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982513706] [2020-02-10 20:23:54,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:55,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982513706] [2020-02-10 20:23:55,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:55,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:55,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784354248] [2020-02-10 20:23:55,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:55,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:55,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:55,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:55,320 INFO L87 Difference]: Start difference. First operand 1582 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:23:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:55,527 INFO L93 Difference]: Finished difference Result 2938 states and 11599 transitions. [2020-02-10 20:23:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:55,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:55,534 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:23:55,534 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:23:55,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:23:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1565. [2020-02-10 20:23:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:23:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7026 transitions. [2020-02-10 20:23:55,600 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7026 transitions. Word has length 28 [2020-02-10 20:23:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:55,600 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7026 transitions. [2020-02-10 20:23:55,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7026 transitions. [2020-02-10 20:23:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:55,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:55,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:55,602 INFO L427 AbstractCegarLoop]: === Iteration 867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:55,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:55,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1014223194, now seen corresponding path program 859 times [2020-02-10 20:23:55,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:55,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549465633] [2020-02-10 20:23:55,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:56,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549465633] [2020-02-10 20:23:56,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:56,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:56,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482600319] [2020-02-10 20:23:56,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:56,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:56,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:56,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:56,134 INFO L87 Difference]: Start difference. First operand 1565 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:23:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:56,325 INFO L93 Difference]: Finished difference Result 2935 states and 11609 transitions. [2020-02-10 20:23:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:56,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:56,332 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 20:23:56,333 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 20:23:56,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 20:23:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1580. [2020-02-10 20:23:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:23:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7067 transitions. [2020-02-10 20:23:56,397 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7067 transitions. Word has length 28 [2020-02-10 20:23:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:56,397 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7067 transitions. [2020-02-10 20:23:56,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7067 transitions. [2020-02-10 20:23:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:56,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:56,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:56,400 INFO L427 AbstractCegarLoop]: === Iteration 868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1758925692, now seen corresponding path program 860 times [2020-02-10 20:23:56,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:56,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253138756] [2020-02-10 20:23:56,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:56,936 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:23:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:56,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253138756] [2020-02-10 20:23:56,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:56,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:56,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857090788] [2020-02-10 20:23:56,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:56,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:56,943 INFO L87 Difference]: Start difference. First operand 1580 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:23:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:57,092 INFO L93 Difference]: Finished difference Result 2939 states and 11610 transitions. [2020-02-10 20:23:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:57,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:57,099 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:23:57,100 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:23:57,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:23:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1573. [2020-02-10 20:23:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:23:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7047 transitions. [2020-02-10 20:23:57,165 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7047 transitions. Word has length 28 [2020-02-10 20:23:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:57,165 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7047 transitions. [2020-02-10 20:23:57,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7047 transitions. [2020-02-10 20:23:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:57,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:57,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:57,168 INFO L427 AbstractCegarLoop]: === Iteration 869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:57,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:57,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1669803144, now seen corresponding path program 861 times [2020-02-10 20:23:57,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:57,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822774971] [2020-02-10 20:23:57,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:57,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822774971] [2020-02-10 20:23:57,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:57,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:57,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625757181] [2020-02-10 20:23:57,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:57,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:57,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:57,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:57,705 INFO L87 Difference]: Start difference. First operand 1573 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:23:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:57,903 INFO L93 Difference]: Finished difference Result 2932 states and 11597 transitions. [2020-02-10 20:23:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:57,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:57,910 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:23:57,910 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:23:57,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:23:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1579. [2020-02-10 20:23:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:23:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7058 transitions. [2020-02-10 20:23:57,975 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7058 transitions. Word has length 28 [2020-02-10 20:23:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:57,975 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7058 transitions. [2020-02-10 20:23:57,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7058 transitions. [2020-02-10 20:23:57,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:57,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:57,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:57,977 INFO L427 AbstractCegarLoop]: === Iteration 870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:57,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:57,978 INFO L82 PathProgramCache]: Analyzing trace with hash -180398148, now seen corresponding path program 862 times [2020-02-10 20:23:57,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:57,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771470614] [2020-02-10 20:23:57,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:58,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771470614] [2020-02-10 20:23:58,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:58,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:58,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16476169] [2020-02-10 20:23:58,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:58,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:58,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:58,507 INFO L87 Difference]: Start difference. First operand 1579 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:23:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:58,692 INFO L93 Difference]: Finished difference Result 2934 states and 11595 transitions. [2020-02-10 20:23:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:58,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:58,700 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:23:58,700 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:23:58,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:23:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1573. [2020-02-10 20:23:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:23:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7041 transitions. [2020-02-10 20:23:58,792 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7041 transitions. Word has length 28 [2020-02-10 20:23:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:58,792 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7041 transitions. [2020-02-10 20:23:58,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7041 transitions. [2020-02-10 20:23:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:58,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:58,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:58,795 INFO L427 AbstractCegarLoop]: === Iteration 871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:58,796 INFO L82 PathProgramCache]: Analyzing trace with hash 685840312, now seen corresponding path program 863 times [2020-02-10 20:23:58,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:58,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409656122] [2020-02-10 20:23:58,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:59,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-02-10 20:23:59,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409656122] [2020-02-10 20:23:59,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:59,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:23:59,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270194999] [2020-02-10 20:23:59,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:23:59,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:59,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:23:59,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:59,331 INFO L87 Difference]: Start difference. First operand 1573 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:23:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:59,466 INFO L93 Difference]: Finished difference Result 2944 states and 11614 transitions. [2020-02-10 20:23:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:23:59,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:23:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:59,474 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:23:59,474 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:23:59,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:23:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:23:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1583. [2020-02-10 20:23:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:23:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7058 transitions. [2020-02-10 20:23:59,540 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7058 transitions. Word has length 28 [2020-02-10 20:23:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:59,540 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7058 transitions. [2020-02-10 20:23:59,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:23:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7058 transitions. [2020-02-10 20:23:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:23:59,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:59,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:59,542 INFO L427 AbstractCegarLoop]: === Iteration 872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:59,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1430542810, now seen corresponding path program 864 times [2020-02-10 20:23:59,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:59,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143152166] [2020-02-10 20:23:59,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:00,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143152166] [2020-02-10 20:24:00,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:00,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:00,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723377911] [2020-02-10 20:24:00,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:00,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:00,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:00,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:00,075 INFO L87 Difference]: Start difference. First operand 1583 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:24:00,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:00,290 INFO L93 Difference]: Finished difference Result 2942 states and 11602 transitions. [2020-02-10 20:24:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:00,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:00,298 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:24:00,298 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:24:00,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:24:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1558. [2020-02-10 20:24:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2020-02-10 20:24:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 7008 transitions. [2020-02-10 20:24:00,362 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 7008 transitions. Word has length 28 [2020-02-10 20:24:00,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:00,362 INFO L479 AbstractCegarLoop]: Abstraction has 1558 states and 7008 transitions. [2020-02-10 20:24:00,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 7008 transitions. [2020-02-10 20:24:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:00,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:00,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:00,364 INFO L427 AbstractCegarLoop]: === Iteration 873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:00,364 INFO L82 PathProgramCache]: Analyzing trace with hash -556215610, now seen corresponding path program 865 times [2020-02-10 20:24:00,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:00,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960019304] [2020-02-10 20:24:00,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:00,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960019304] [2020-02-10 20:24:00,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:00,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:00,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460227975] [2020-02-10 20:24:00,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:00,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:00,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:00,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:00,871 INFO L87 Difference]: Start difference. First operand 1558 states and 7008 transitions. Second operand 11 states. [2020-02-10 20:24:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:01,042 INFO L93 Difference]: Finished difference Result 2889 states and 11495 transitions. [2020-02-10 20:24:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:01,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:01,050 INFO L225 Difference]: With dead ends: 2889 [2020-02-10 20:24:01,050 INFO L226 Difference]: Without dead ends: 2874 [2020-02-10 20:24:01,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2020-02-10 20:24:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 1573. [2020-02-10 20:24:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:24:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 20:24:01,115 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 20:24:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:01,115 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 20:24:01,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:01,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 20:24:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:01,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:01,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:01,118 INFO L427 AbstractCegarLoop]: === Iteration 874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:01,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:01,118 INFO L82 PathProgramCache]: Analyzing trace with hash 188486888, now seen corresponding path program 866 times [2020-02-10 20:24:01,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:01,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739055849] [2020-02-10 20:24:01,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:01,629 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:24:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:01,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739055849] [2020-02-10 20:24:01,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:01,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:01,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14170737] [2020-02-10 20:24:01,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:01,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:01,637 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:24:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:01,809 INFO L93 Difference]: Finished difference Result 2890 states and 11492 transitions. [2020-02-10 20:24:01,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:01,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:01,817 INFO L225 Difference]: With dead ends: 2890 [2020-02-10 20:24:01,817 INFO L226 Difference]: Without dead ends: 2869 [2020-02-10 20:24:01,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2020-02-10 20:24:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1568. [2020-02-10 20:24:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:24:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7043 transitions. [2020-02-10 20:24:01,882 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7043 transitions. Word has length 28 [2020-02-10 20:24:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:01,882 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7043 transitions. [2020-02-10 20:24:01,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7043 transitions. [2020-02-10 20:24:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:01,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:01,885 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:01,885 INFO L427 AbstractCegarLoop]: === Iteration 875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1054725348, now seen corresponding path program 867 times [2020-02-10 20:24:01,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:01,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733236921] [2020-02-10 20:24:01,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:02,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733236921] [2020-02-10 20:24:02,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:02,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:02,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201030746] [2020-02-10 20:24:02,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:02,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:02,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:02,391 INFO L87 Difference]: Start difference. First operand 1568 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:24:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:02,572 INFO L93 Difference]: Finished difference Result 2894 states and 11499 transitions. [2020-02-10 20:24:02,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:02,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:02,580 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 20:24:02,580 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 20:24:02,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 20:24:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1574. [2020-02-10 20:24:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:24:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 20:24:02,644 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 20:24:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:02,644 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 20:24:02,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 20:24:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:02,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24: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, 1, 1, 1] [2020-02-10 20:24:02,647 INFO L427 AbstractCegarLoop]: === Iteration 876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1750836952, now seen corresponding path program 868 times [2020-02-10 20:24:02,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:02,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922470913] [2020-02-10 20:24:02,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:03,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922470913] [2020-02-10 20:24:03,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:03,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:03,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435663651] [2020-02-10 20:24:03,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:03,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:03,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:03,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:03,162 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:24:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:03,303 INFO L93 Difference]: Finished difference Result 2899 states and 11503 transitions. [2020-02-10 20:24:03,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:03,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:03,310 INFO L225 Difference]: With dead ends: 2899 [2020-02-10 20:24:03,311 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 20:24:03,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 20:24:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1568. [2020-02-10 20:24:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:24:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7037 transitions. [2020-02-10 20:24:03,375 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7037 transitions. Word has length 28 [2020-02-10 20:24:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:03,376 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7037 transitions. [2020-02-10 20:24:03,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7037 transitions. [2020-02-10 20:24:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:03,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:03,378 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:03,378 INFO L427 AbstractCegarLoop]: === Iteration 877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash -884598492, now seen corresponding path program 869 times [2020-02-10 20:24:03,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:03,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920467298] [2020-02-10 20:24:03,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:03,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920467298] [2020-02-10 20:24:03,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:03,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:03,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684584607] [2020-02-10 20:24:03,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:03,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:03,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:03,903 INFO L87 Difference]: Start difference. First operand 1568 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:24:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:04,074 INFO L93 Difference]: Finished difference Result 2897 states and 11500 transitions. [2020-02-10 20:24:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:04,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:04,081 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:24:04,081 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:24:04,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:24:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1575. [2020-02-10 20:24:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:24:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7050 transitions. [2020-02-10 20:24:04,144 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7050 transitions. Word has length 28 [2020-02-10 20:24:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:04,144 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7050 transitions. [2020-02-10 20:24:04,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:04,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7050 transitions. [2020-02-10 20:24:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:04,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:04,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:04,147 INFO L427 AbstractCegarLoop]: === Iteration 878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash -139895994, now seen corresponding path program 870 times [2020-02-10 20:24:04,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:04,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217283477] [2020-02-10 20:24:04,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:04,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217283477] [2020-02-10 20:24:04,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:04,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:04,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455365768] [2020-02-10 20:24:04,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:04,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:04,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:04,674 INFO L87 Difference]: Start difference. First operand 1575 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:24:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:04,840 INFO L93 Difference]: Finished difference Result 2901 states and 11501 transitions. [2020-02-10 20:24:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:04,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:04,847 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 20:24:04,847 INFO L226 Difference]: Without dead ends: 2868 [2020-02-10 20:24:04,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2020-02-10 20:24:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 1562. [2020-02-10 20:24:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:24:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7022 transitions. [2020-02-10 20:24:04,944 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7022 transitions. Word has length 28 [2020-02-10 20:24:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:04,944 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7022 transitions. [2020-02-10 20:24:04,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7022 transitions. [2020-02-10 20:24:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:04,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24: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, 1, 1, 1] [2020-02-10 20:24:04,946 INFO L427 AbstractCegarLoop]: === Iteration 879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:04,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1913959506, now seen corresponding path program 871 times [2020-02-10 20:24:04,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:04,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320376314] [2020-02-10 20:24:04,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:05,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320376314] [2020-02-10 20:24:05,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:05,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:05,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044578789] [2020-02-10 20:24:05,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:05,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:05,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:05,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:05,468 INFO L87 Difference]: Start difference. First operand 1562 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:24:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:05,644 INFO L93 Difference]: Finished difference Result 2872 states and 11448 transitions. [2020-02-10 20:24:05,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:05,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:05,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:05,652 INFO L225 Difference]: With dead ends: 2872 [2020-02-10 20:24:05,652 INFO L226 Difference]: Without dead ends: 2857 [2020-02-10 20:24:05,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-02-10 20:24:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1570. [2020-02-10 20:24:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:24:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7042 transitions. [2020-02-10 20:24:05,716 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7042 transitions. Word has length 28 [2020-02-10 20:24:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:05,717 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7042 transitions. [2020-02-10 20:24:05,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7042 transitions. [2020-02-10 20:24:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:05,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:05,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:05,719 INFO L427 AbstractCegarLoop]: === Iteration 880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:05,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:05,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1636305292, now seen corresponding path program 872 times [2020-02-10 20:24:05,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:05,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334078148] [2020-02-10 20:24:05,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:06,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334078148] [2020-02-10 20:24:06,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:06,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:06,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160077681] [2020-02-10 20:24:06,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:06,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:06,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:06,231 INFO L87 Difference]: Start difference. First operand 1570 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:24:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:06,459 INFO L93 Difference]: Finished difference Result 2873 states and 11445 transitions. [2020-02-10 20:24:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:06,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:06,467 INFO L225 Difference]: With dead ends: 2873 [2020-02-10 20:24:06,467 INFO L226 Difference]: Without dead ends: 2852 [2020-02-10 20:24:06,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-02-10 20:24:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1565. [2020-02-10 20:24:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:24:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7030 transitions. [2020-02-10 20:24:06,530 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7030 transitions. Word has length 28 [2020-02-10 20:24:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:06,530 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7030 transitions. [2020-02-10 20:24:06,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7030 transitions. [2020-02-10 20:24:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:06,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:06,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:06,532 INFO L427 AbstractCegarLoop]: === Iteration 881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:06,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1202891370, now seen corresponding path program 873 times [2020-02-10 20:24:06,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:06,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601927909] [2020-02-10 20:24:06,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:07,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601927909] [2020-02-10 20:24:07,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:07,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:07,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170468281] [2020-02-10 20:24:07,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:07,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:07,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:07,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:07,039 INFO L87 Difference]: Start difference. First operand 1565 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:24:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:07,283 INFO L93 Difference]: Finished difference Result 2867 states and 11433 transitions. [2020-02-10 20:24:07,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:07,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:07,291 INFO L225 Difference]: With dead ends: 2867 [2020-02-10 20:24:07,291 INFO L226 Difference]: Without dead ends: 2852 [2020-02-10 20:24:07,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-02-10 20:24:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1568. [2020-02-10 20:24:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:24:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7035 transitions. [2020-02-10 20:24:07,355 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7035 transitions. Word has length 28 [2020-02-10 20:24:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:07,355 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7035 transitions. [2020-02-10 20:24:07,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7035 transitions. [2020-02-10 20:24:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:07,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:07,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:07,358 INFO L427 AbstractCegarLoop]: === Iteration 882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:07,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1744945170, now seen corresponding path program 874 times [2020-02-10 20:24:07,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:07,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111767209] [2020-02-10 20:24:07,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:07,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111767209] [2020-02-10 20:24:07,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:07,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:07,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718313852] [2020-02-10 20:24:07,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:07,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:07,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:07,862 INFO L87 Difference]: Start difference. First operand 1568 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:24:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:08,091 INFO L93 Difference]: Finished difference Result 2865 states and 11426 transitions. [2020-02-10 20:24:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:08,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:08,098 INFO L225 Difference]: With dead ends: 2865 [2020-02-10 20:24:08,098 INFO L226 Difference]: Without dead ends: 2849 [2020-02-10 20:24:08,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2020-02-10 20:24:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 1565. [2020-02-10 20:24:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:24:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7027 transitions. [2020-02-10 20:24:08,161 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7027 transitions. Word has length 28 [2020-02-10 20:24:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:08,161 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7027 transitions. [2020-02-10 20:24:08,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7027 transitions. [2020-02-10 20:24:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:08,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:08,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:08,164 INFO L427 AbstractCegarLoop]: === Iteration 883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:08,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:08,164 INFO L82 PathProgramCache]: Analyzing trace with hash -447685768, now seen corresponding path program 875 times [2020-02-10 20:24:08,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:08,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701673560] [2020-02-10 20:24:08,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:08,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701673560] [2020-02-10 20:24:08,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:08,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:08,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063192719] [2020-02-10 20:24:08,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:08,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:08,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:08,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:08,673 INFO L87 Difference]: Start difference. First operand 1565 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:24:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:08,867 INFO L93 Difference]: Finished difference Result 2869 states and 11434 transitions. [2020-02-10 20:24:08,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:08,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:08,875 INFO L225 Difference]: With dead ends: 2869 [2020-02-10 20:24:08,875 INFO L226 Difference]: Without dead ends: 2853 [2020-02-10 20:24:08,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2020-02-10 20:24:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1568. [2020-02-10 20:24:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:24:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7032 transitions. [2020-02-10 20:24:08,939 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7032 transitions. Word has length 28 [2020-02-10 20:24:08,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:08,939 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7032 transitions. [2020-02-10 20:24:08,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7032 transitions. [2020-02-10 20:24:08,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:08,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:08,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:08,941 INFO L427 AbstractCegarLoop]: === Iteration 884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash 144507316, now seen corresponding path program 876 times [2020-02-10 20:24:08,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:08,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809781866] [2020-02-10 20:24:08,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:09,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809781866] [2020-02-10 20:24:09,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:09,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:09,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231042124] [2020-02-10 20:24:09,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:09,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:09,454 INFO L87 Difference]: Start difference. First operand 1568 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:24:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:09,659 INFO L93 Difference]: Finished difference Result 2866 states and 11425 transitions. [2020-02-10 20:24:09,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:09,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:09,667 INFO L225 Difference]: With dead ends: 2866 [2020-02-10 20:24:09,667 INFO L226 Difference]: Without dead ends: 2847 [2020-02-10 20:24:09,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2020-02-10 20:24:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 1562. [2020-02-10 20:24:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:24:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7019 transitions. [2020-02-10 20:24:09,732 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7019 transitions. Word has length 28 [2020-02-10 20:24:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:09,732 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7019 transitions. [2020-02-10 20:24:09,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7019 transitions. [2020-02-10 20:24:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:09,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:09,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, 1, 1, 1] [2020-02-10 20:24:09,735 INFO L427 AbstractCegarLoop]: === Iteration 885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:09,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash -444470608, now seen corresponding path program 877 times [2020-02-10 20:24:09,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:09,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141279028] [2020-02-10 20:24:09,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:10,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141279028] [2020-02-10 20:24:10,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:10,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:10,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957510461] [2020-02-10 20:24:10,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:10,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:10,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:10,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:10,251 INFO L87 Difference]: Start difference. First operand 1562 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:24:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:10,484 INFO L93 Difference]: Finished difference Result 2884 states and 11468 transitions. [2020-02-10 20:24:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:10,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:10,492 INFO L225 Difference]: With dead ends: 2884 [2020-02-10 20:24:10,492 INFO L226 Difference]: Without dead ends: 2869 [2020-02-10 20:24:10,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:10,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2020-02-10 20:24:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1572. [2020-02-10 20:24:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:24:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7044 transitions. [2020-02-10 20:24:10,557 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7044 transitions. Word has length 28 [2020-02-10 20:24:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:10,557 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7044 transitions. [2020-02-10 20:24:10,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7044 transitions. [2020-02-10 20:24:10,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:10,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:10,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, 1, 1, 1] [2020-02-10 20:24:10,560 INFO L427 AbstractCegarLoop]: === Iteration 886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:10,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:10,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1044934388, now seen corresponding path program 878 times [2020-02-10 20:24:10,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:10,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68625090] [2020-02-10 20:24:10,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:11,116 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2020-02-10 20:24:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:11,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68625090] [2020-02-10 20:24:11,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:11,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:11,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085354673] [2020-02-10 20:24:11,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:11,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:11,122 INFO L87 Difference]: Start difference. First operand 1572 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:24:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:11,268 INFO L93 Difference]: Finished difference Result 2889 states and 11472 transitions. [2020-02-10 20:24:11,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:11,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:11,275 INFO L225 Difference]: With dead ends: 2889 [2020-02-10 20:24:11,275 INFO L226 Difference]: Without dead ends: 2863 [2020-02-10 20:24:11,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2020-02-10 20:24:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 1566. [2020-02-10 20:24:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:24:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7029 transitions. [2020-02-10 20:24:11,339 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7029 transitions. Word has length 28 [2020-02-10 20:24:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:11,339 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7029 transitions. [2020-02-10 20:24:11,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7029 transitions. [2020-02-10 20:24:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:11,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:11,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:11,341 INFO L427 AbstractCegarLoop]: === Iteration 887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:11,342 INFO L82 PathProgramCache]: Analyzing trace with hash 723142708, now seen corresponding path program 879 times [2020-02-10 20:24:11,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:11,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087380858] [2020-02-10 20:24:11,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:11,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087380858] [2020-02-10 20:24:11,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:11,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:11,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349868669] [2020-02-10 20:24:11,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:11,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:11,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:11,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:11,839 INFO L87 Difference]: Start difference. First operand 1566 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:24:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:12,030 INFO L93 Difference]: Finished difference Result 2874 states and 11443 transitions. [2020-02-10 20:24:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:12,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:12,038 INFO L225 Difference]: With dead ends: 2874 [2020-02-10 20:24:12,038 INFO L226 Difference]: Without dead ends: 2859 [2020-02-10 20:24:12,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-02-10 20:24:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 1569. [2020-02-10 20:24:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:24:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7034 transitions. [2020-02-10 20:24:12,103 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7034 transitions. Word has length 28 [2020-02-10 20:24:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:12,103 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7034 transitions. [2020-02-10 20:24:12,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7034 transitions. [2020-02-10 20:24:12,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:12,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:12,106 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:12,106 INFO L427 AbstractCegarLoop]: === Iteration 888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:12,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:12,106 INFO L82 PathProgramCache]: Analyzing trace with hash -623988048, now seen corresponding path program 880 times [2020-02-10 20:24:12,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:12,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958029753] [2020-02-10 20:24:12,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:12,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958029753] [2020-02-10 20:24:12,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:12,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:12,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996166203] [2020-02-10 20:24:12,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:12,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:12,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:12,609 INFO L87 Difference]: Start difference. First operand 1569 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:24:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:12,852 INFO L93 Difference]: Finished difference Result 2872 states and 11436 transitions. [2020-02-10 20:24:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:12,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:12,859 INFO L225 Difference]: With dead ends: 2872 [2020-02-10 20:24:12,859 INFO L226 Difference]: Without dead ends: 2856 [2020-02-10 20:24:12,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2020-02-10 20:24:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1566. [2020-02-10 20:24:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:24:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7026 transitions. [2020-02-10 20:24:12,922 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7026 transitions. Word has length 28 [2020-02-10 20:24:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:12,922 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7026 transitions. [2020-02-10 20:24:12,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7026 transitions. [2020-02-10 20:24:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:12,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:12,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:12,925 INFO L427 AbstractCegarLoop]: === Iteration 889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2061413384, now seen corresponding path program 881 times [2020-02-10 20:24:12,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:12,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496191276] [2020-02-10 20:24:12,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:13,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496191276] [2020-02-10 20:24:13,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:13,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:13,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896170857] [2020-02-10 20:24:13,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:13,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:13,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:13,431 INFO L87 Difference]: Start difference. First operand 1566 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:24:13,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:13,629 INFO L93 Difference]: Finished difference Result 2885 states and 11460 transitions. [2020-02-10 20:24:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:13,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:13,637 INFO L225 Difference]: With dead ends: 2885 [2020-02-10 20:24:13,637 INFO L226 Difference]: Without dead ends: 2865 [2020-02-10 20:24:13,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-02-10 20:24:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 1570. [2020-02-10 20:24:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:24:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7032 transitions. [2020-02-10 20:24:13,700 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7032 transitions. Word has length 28 [2020-02-10 20:24:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:13,700 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7032 transitions. [2020-02-10 20:24:13,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7032 transitions. [2020-02-10 20:24:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:13,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:13,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:13,702 INFO L427 AbstractCegarLoop]: === Iteration 890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash 470103540, now seen corresponding path program 882 times [2020-02-10 20:24:13,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:13,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748666295] [2020-02-10 20:24:13,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:14,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748666295] [2020-02-10 20:24:14,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:14,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:14,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372517609] [2020-02-10 20:24:14,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:14,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:14,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:14,203 INFO L87 Difference]: Start difference. First operand 1570 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:24:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:14,397 INFO L93 Difference]: Finished difference Result 2878 states and 11443 transitions. [2020-02-10 20:24:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:14,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:14,404 INFO L225 Difference]: With dead ends: 2878 [2020-02-10 20:24:14,405 INFO L226 Difference]: Without dead ends: 2857 [2020-02-10 20:24:14,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-02-10 20:24:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1562. [2020-02-10 20:24:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:24:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7015 transitions. [2020-02-10 20:24:14,470 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7015 transitions. Word has length 28 [2020-02-10 20:24:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:14,470 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7015 transitions. [2020-02-10 20:24:14,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7015 transitions. [2020-02-10 20:24:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:14,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:14,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, 1, 1, 1] [2020-02-10 20:24:14,473 INFO L427 AbstractCegarLoop]: === Iteration 891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:14,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:14,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2058198224, now seen corresponding path program 883 times [2020-02-10 20:24:14,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:14,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101675020] [2020-02-10 20:24:14,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:14,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101675020] [2020-02-10 20:24:14,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:14,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:14,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262339911] [2020-02-10 20:24:14,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:14,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:14,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:14,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:14,984 INFO L87 Difference]: Start difference. First operand 1562 states and 7015 transitions. Second operand 11 states. [2020-02-10 20:24:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:15,154 INFO L93 Difference]: Finished difference Result 2889 states and 11476 transitions. [2020-02-10 20:24:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:15,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:15,161 INFO L225 Difference]: With dead ends: 2889 [2020-02-10 20:24:15,162 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 20:24:15,162 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 20:24:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1573. [2020-02-10 20:24:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:24:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7042 transitions. [2020-02-10 20:24:15,225 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7042 transitions. Word has length 28 [2020-02-10 20:24:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:15,225 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7042 transitions. [2020-02-10 20:24:15,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7042 transitions. [2020-02-10 20:24:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:15,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:15,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:15,227 INFO L427 AbstractCegarLoop]: === Iteration 892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:15,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1313495726, now seen corresponding path program 884 times [2020-02-10 20:24:15,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:15,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403600874] [2020-02-10 20:24:15,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:15,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403600874] [2020-02-10 20:24:15,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:15,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:15,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581831097] [2020-02-10 20:24:15,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:15,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:15,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:15,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:15,759 INFO L87 Difference]: Start difference. First operand 1573 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:24:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:15,903 INFO L93 Difference]: Finished difference Result 2893 states and 11477 transitions. [2020-02-10 20:24:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:15,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:15,911 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:24:15,911 INFO L226 Difference]: Without dead ends: 2866 [2020-02-10 20:24:15,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2020-02-10 20:24:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 1566. [2020-02-10 20:24:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:24:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7025 transitions. [2020-02-10 20:24:15,976 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7025 transitions. Word has length 28 [2020-02-10 20:24:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:15,976 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7025 transitions. [2020-02-10 20:24:15,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7025 transitions. [2020-02-10 20:24:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:15,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:15,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:15,978 INFO L427 AbstractCegarLoop]: === Iteration 893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash -890584908, now seen corresponding path program 885 times [2020-02-10 20:24:15,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:15,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725792159] [2020-02-10 20:24:15,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:16,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725792159] [2020-02-10 20:24:16,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:16,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:16,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921316959] [2020-02-10 20:24:16,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:16,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:16,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:16,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:16,493 INFO L87 Difference]: Start difference. First operand 1566 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:24:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:16,698 INFO L93 Difference]: Finished difference Result 2878 states and 11448 transitions. [2020-02-10 20:24:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:16,699 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:16,706 INFO L225 Difference]: With dead ends: 2878 [2020-02-10 20:24:16,706 INFO L226 Difference]: Without dead ends: 2862 [2020-02-10 20:24:16,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2020-02-10 20:24:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1569. [2020-02-10 20:24:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:24:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7030 transitions. [2020-02-10 20:24:16,769 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7030 transitions. Word has length 28 [2020-02-10 20:24:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:16,769 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7030 transitions. [2020-02-10 20:24:16,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7030 transitions. [2020-02-10 20:24:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:16,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:16,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:16,772 INFO L427 AbstractCegarLoop]: === Iteration 894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:16,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:16,772 INFO L82 PathProgramCache]: Analyzing trace with hash -298391824, now seen corresponding path program 886 times [2020-02-10 20:24:16,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:16,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267692881] [2020-02-10 20:24:16,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:17,253 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:24:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:17,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267692881] [2020-02-10 20:24:17,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:17,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:17,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069524456] [2020-02-10 20:24:17,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:17,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:17,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:17,374 INFO L87 Difference]: Start difference. First operand 1569 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:24:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:17,588 INFO L93 Difference]: Finished difference Result 2875 states and 11439 transitions. [2020-02-10 20:24:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:17,588 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:17,595 INFO L225 Difference]: With dead ends: 2875 [2020-02-10 20:24:17,595 INFO L226 Difference]: Without dead ends: 2859 [2020-02-10 20:24:17,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-02-10 20:24:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 1566. [2020-02-10 20:24:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:24:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7022 transitions. [2020-02-10 20:24:17,660 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7022 transitions. Word has length 28 [2020-02-10 20:24:17,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:17,660 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7022 transitions. [2020-02-10 20:24:17,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7022 transitions. [2020-02-10 20:24:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:17,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:17,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:17,663 INFO L427 AbstractCegarLoop]: === Iteration 895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash -135379306, now seen corresponding path program 887 times [2020-02-10 20:24:17,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:17,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311271520] [2020-02-10 20:24:17,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:18,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311271520] [2020-02-10 20:24:18,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:18,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:18,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245642300] [2020-02-10 20:24:18,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:18,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:18,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:18,184 INFO L87 Difference]: Start difference. First operand 1566 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:24:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:18,376 INFO L93 Difference]: Finished difference Result 2887 states and 11461 transitions. [2020-02-10 20:24:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:18,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:18,384 INFO L225 Difference]: With dead ends: 2887 [2020-02-10 20:24:18,384 INFO L226 Difference]: Without dead ends: 2867 [2020-02-10 20:24:18,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2020-02-10 20:24:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1570. [2020-02-10 20:24:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:24:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7028 transitions. [2020-02-10 20:24:18,448 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7028 transitions. Word has length 28 [2020-02-10 20:24:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:18,448 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7028 transitions. [2020-02-10 20:24:18,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7028 transitions. [2020-02-10 20:24:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:18,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:18,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:18,450 INFO L427 AbstractCegarLoop]: === Iteration 896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:18,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1898829678, now seen corresponding path program 888 times [2020-02-10 20:24:18,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:18,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857761077] [2020-02-10 20:24:18,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:18,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857761077] [2020-02-10 20:24:18,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:18,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:18,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073422682] [2020-02-10 20:24:18,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:18,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:18,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:18,960 INFO L87 Difference]: Start difference. First operand 1570 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:24:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:19,148 INFO L93 Difference]: Finished difference Result 2880 states and 11444 transitions. [2020-02-10 20:24:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:19,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:19,156 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 20:24:19,156 INFO L226 Difference]: Without dead ends: 2855 [2020-02-10 20:24:19,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2020-02-10 20:24:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 1558. [2020-02-10 20:24:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2020-02-10 20:24:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 7004 transitions. [2020-02-10 20:24:19,221 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 7004 transitions. Word has length 28 [2020-02-10 20:24:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:19,221 INFO L479 AbstractCegarLoop]: Abstraction has 1558 states and 7004 transitions. [2020-02-10 20:24:19,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 7004 transitions. [2020-02-10 20:24:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:19,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:19,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:19,224 INFO L427 AbstractCegarLoop]: === Iteration 897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:19,224 INFO L82 PathProgramCache]: Analyzing trace with hash 236053416, now seen corresponding path program 889 times [2020-02-10 20:24:19,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:19,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295672214] [2020-02-10 20:24:19,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:19,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295672214] [2020-02-10 20:24:19,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:19,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:19,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925734463] [2020-02-10 20:24:19,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:19,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:19,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:19,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:19,756 INFO L87 Difference]: Start difference. First operand 1558 states and 7004 transitions. Second operand 11 states. [2020-02-10 20:24:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:19,981 INFO L93 Difference]: Finished difference Result 2875 states and 11459 transitions. [2020-02-10 20:24:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:19,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:19,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:19,989 INFO L225 Difference]: With dead ends: 2875 [2020-02-10 20:24:19,989 INFO L226 Difference]: Without dead ends: 2860 [2020-02-10 20:24:19,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2020-02-10 20:24:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 1571. [2020-02-10 20:24:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:24:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7046 transitions. [2020-02-10 20:24:20,053 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7046 transitions. Word has length 28 [2020-02-10 20:24:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:20,053 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7046 transitions. [2020-02-10 20:24:20,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:20,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7046 transitions. [2020-02-10 20:24:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:20,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:20,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:20,056 INFO L427 AbstractCegarLoop]: === Iteration 898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:20,056 INFO L82 PathProgramCache]: Analyzing trace with hash 980755914, now seen corresponding path program 890 times [2020-02-10 20:24:20,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:20,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540288518] [2020-02-10 20:24:20,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:20,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540288518] [2020-02-10 20:24:20,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:20,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:20,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990449571] [2020-02-10 20:24:20,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:20,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:20,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:20,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:20,563 INFO L87 Difference]: Start difference. First operand 1571 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:24:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:20,777 INFO L93 Difference]: Finished difference Result 2876 states and 11456 transitions. [2020-02-10 20:24:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:20,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:20,784 INFO L225 Difference]: With dead ends: 2876 [2020-02-10 20:24:20,784 INFO L226 Difference]: Without dead ends: 2855 [2020-02-10 20:24:20,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2020-02-10 20:24:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 1566. [2020-02-10 20:24:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:24:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7032 transitions. [2020-02-10 20:24:20,847 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7032 transitions. Word has length 28 [2020-02-10 20:24:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:20,847 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7032 transitions. [2020-02-10 20:24:20,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7032 transitions. [2020-02-10 20:24:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:20,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:20,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:20,849 INFO L427 AbstractCegarLoop]: === Iteration 899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:20,850 INFO L82 PathProgramCache]: Analyzing trace with hash -837031964, now seen corresponding path program 891 times [2020-02-10 20:24:20,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:20,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27701033] [2020-02-10 20:24:20,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:21,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27701033] [2020-02-10 20:24:21,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:21,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:21,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032848369] [2020-02-10 20:24:21,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:21,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:21,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:21,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:21,349 INFO L87 Difference]: Start difference. First operand 1566 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:24:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:21,607 INFO L93 Difference]: Finished difference Result 2877 states and 11458 transitions. [2020-02-10 20:24:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:21,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:21,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:21,615 INFO L225 Difference]: With dead ends: 2877 [2020-02-10 20:24:21,615 INFO L226 Difference]: Without dead ends: 2862 [2020-02-10 20:24:21,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2020-02-10 20:24:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1571. [2020-02-10 20:24:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:24:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7041 transitions. [2020-02-10 20:24:21,680 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7041 transitions. Word has length 28 [2020-02-10 20:24:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:21,680 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7041 transitions. [2020-02-10 20:24:21,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7041 transitions. [2020-02-10 20:24:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:21,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:21,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:21,682 INFO L427 AbstractCegarLoop]: === Iteration 900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:21,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1397075530, now seen corresponding path program 892 times [2020-02-10 20:24:21,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:21,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361675924] [2020-02-10 20:24:21,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:22,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361675924] [2020-02-10 20:24:22,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:22,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:22,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144015313] [2020-02-10 20:24:22,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:22,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:22,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:22,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:22,183 INFO L87 Difference]: Start difference. First operand 1571 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:24:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:22,448 INFO L93 Difference]: Finished difference Result 2880 states and 11459 transitions. [2020-02-10 20:24:22,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:22,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:22,455 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 20:24:22,456 INFO L226 Difference]: Without dead ends: 2857 [2020-02-10 20:24:22,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-02-10 20:24:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1566. [2020-02-10 20:24:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:24:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7027 transitions. [2020-02-10 20:24:22,519 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7027 transitions. Word has length 28 [2020-02-10 20:24:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:22,519 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7027 transitions. [2020-02-10 20:24:22,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7027 transitions. [2020-02-10 20:24:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:22,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:22,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:22,521 INFO L427 AbstractCegarLoop]: === Iteration 901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1518611492, now seen corresponding path program 893 times [2020-02-10 20:24:22,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:22,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845615972] [2020-02-10 20:24:22,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:23,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845615972] [2020-02-10 20:24:23,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:23,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:23,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318624555] [2020-02-10 20:24:23,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:23,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:23,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:23,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:23,026 INFO L87 Difference]: Start difference. First operand 1566 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:24:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:23,289 INFO L93 Difference]: Finished difference Result 2880 states and 11460 transitions. [2020-02-10 20:24:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:23,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:23,296 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 20:24:23,296 INFO L226 Difference]: Without dead ends: 2864 [2020-02-10 20:24:23,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2020-02-10 20:24:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 1572. [2020-02-10 20:24:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:24:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7038 transitions. [2020-02-10 20:24:23,359 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7038 transitions. Word has length 28 [2020-02-10 20:24:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:23,359 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7038 transitions. [2020-02-10 20:24:23,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7038 transitions. [2020-02-10 20:24:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:23,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:23,362 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:23,362 INFO L427 AbstractCegarLoop]: === Iteration 902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:23,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1286950808, now seen corresponding path program 894 times [2020-02-10 20:24:23,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:23,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762628044] [2020-02-10 20:24:23,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:23,903 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:24:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:23,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762628044] [2020-02-10 20:24:23,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:23,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:23,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307181342] [2020-02-10 20:24:23,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:23,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:23,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:23,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:23,911 INFO L87 Difference]: Start difference. First operand 1572 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:24:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:24,176 INFO L93 Difference]: Finished difference Result 2882 states and 11458 transitions. [2020-02-10 20:24:24,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:24,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:24,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:24,184 INFO L225 Difference]: With dead ends: 2882 [2020-02-10 20:24:24,184 INFO L226 Difference]: Without dead ends: 2853 [2020-02-10 20:24:24,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2020-02-10 20:24:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1561. [2020-02-10 20:24:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:24:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7015 transitions. [2020-02-10 20:24:24,246 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7015 transitions. Word has length 28 [2020-02-10 20:24:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:24,246 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7015 transitions. [2020-02-10 20:24:24,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7015 transitions. [2020-02-10 20:24:24,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:24,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:24,249 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:24,249 INFO L427 AbstractCegarLoop]: === Iteration 903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:24,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:24,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1746731620, now seen corresponding path program 895 times [2020-02-10 20:24:24,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:24,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591165159] [2020-02-10 20:24:24,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:24,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591165159] [2020-02-10 20:24:24,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:24,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:24,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114680017] [2020-02-10 20:24:24,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:24,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:24,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:24,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:24,765 INFO L87 Difference]: Start difference. First operand 1561 states and 7015 transitions. Second operand 11 states. [2020-02-10 20:24:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:25,035 INFO L93 Difference]: Finished difference Result 2863 states and 11423 transitions. [2020-02-10 20:24:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:25,035 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:25,042 INFO L225 Difference]: With dead ends: 2863 [2020-02-10 20:24:25,042 INFO L226 Difference]: Without dead ends: 2848 [2020-02-10 20:24:25,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2020-02-10 20:24:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1569. [2020-02-10 20:24:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:24:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7035 transitions. [2020-02-10 20:24:25,107 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7035 transitions. Word has length 28 [2020-02-10 20:24:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:25,107 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7035 transitions. [2020-02-10 20:24:25,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7035 transitions. [2020-02-10 20:24:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:25,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:25,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:25,110 INFO L427 AbstractCegarLoop]: === Iteration 904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:25,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1803533178, now seen corresponding path program 896 times [2020-02-10 20:24:25,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:25,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800124778] [2020-02-10 20:24:25,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:25,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800124778] [2020-02-10 20:24:25,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:25,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:25,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173039879] [2020-02-10 20:24:25,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:25,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:25,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:25,617 INFO L87 Difference]: Start difference. First operand 1569 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:24:25,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:25,884 INFO L93 Difference]: Finished difference Result 2864 states and 11420 transitions. [2020-02-10 20:24:25,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:25,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:25,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:25,891 INFO L225 Difference]: With dead ends: 2864 [2020-02-10 20:24:25,892 INFO L226 Difference]: Without dead ends: 2843 [2020-02-10 20:24:25,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2020-02-10 20:24:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 1564. [2020-02-10 20:24:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:24:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7023 transitions. [2020-02-10 20:24:25,956 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7023 transitions. Word has length 28 [2020-02-10 20:24:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:25,956 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7023 transitions. [2020-02-10 20:24:25,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7023 transitions. [2020-02-10 20:24:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:25,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:25,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:25,959 INFO L427 AbstractCegarLoop]: === Iteration 905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:25,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1370119256, now seen corresponding path program 897 times [2020-02-10 20:24:25,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:25,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743196338] [2020-02-10 20:24:25,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:26,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743196338] [2020-02-10 20:24:26,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:26,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:26,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516343766] [2020-02-10 20:24:26,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:26,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:26,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:26,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:26,470 INFO L87 Difference]: Start difference. First operand 1564 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:24:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:26,702 INFO L93 Difference]: Finished difference Result 2858 states and 11408 transitions. [2020-02-10 20:24:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:26,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:26,709 INFO L225 Difference]: With dead ends: 2858 [2020-02-10 20:24:26,710 INFO L226 Difference]: Without dead ends: 2843 [2020-02-10 20:24:26,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2020-02-10 20:24:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 1567. [2020-02-10 20:24:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:24:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7028 transitions. [2020-02-10 20:24:26,774 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7028 transitions. Word has length 28 [2020-02-10 20:24:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:26,774 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7028 transitions. [2020-02-10 20:24:26,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7028 transitions. [2020-02-10 20:24:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:26,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:26,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, 1, 1, 1] [2020-02-10 20:24:26,777 INFO L427 AbstractCegarLoop]: === Iteration 906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:26,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1577717284, now seen corresponding path program 898 times [2020-02-10 20:24:26,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:26,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775900443] [2020-02-10 20:24:26,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:27,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775900443] [2020-02-10 20:24:27,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:27,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:27,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870496978] [2020-02-10 20:24:27,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:27,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:27,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:27,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:27,290 INFO L87 Difference]: Start difference. First operand 1567 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:24:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:27,515 INFO L93 Difference]: Finished difference Result 2856 states and 11401 transitions. [2020-02-10 20:24:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:27,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:27,522 INFO L225 Difference]: With dead ends: 2856 [2020-02-10 20:24:27,522 INFO L226 Difference]: Without dead ends: 2840 [2020-02-10 20:24:27,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2020-02-10 20:24:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 1564. [2020-02-10 20:24:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:24:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7020 transitions. [2020-02-10 20:24:27,585 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7020 transitions. Word has length 28 [2020-02-10 20:24:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:27,586 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7020 transitions. [2020-02-10 20:24:27,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7020 transitions. [2020-02-10 20:24:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:27,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:27,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:27,588 INFO L427 AbstractCegarLoop]: === Iteration 907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:27,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash -614913654, now seen corresponding path program 899 times [2020-02-10 20:24:27,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:27,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123432921] [2020-02-10 20:24:27,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:28,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123432921] [2020-02-10 20:24:28,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:28,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:28,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125286182] [2020-02-10 20:24:28,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:28,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:28,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:28,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:28,105 INFO L87 Difference]: Start difference. First operand 1564 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:24:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:28,306 INFO L93 Difference]: Finished difference Result 2860 states and 11409 transitions. [2020-02-10 20:24:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:28,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:28,313 INFO L225 Difference]: With dead ends: 2860 [2020-02-10 20:24:28,314 INFO L226 Difference]: Without dead ends: 2844 [2020-02-10 20:24:28,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2020-02-10 20:24:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 1567. [2020-02-10 20:24:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:24:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:24:28,377 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:24:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:28,377 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:24:28,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:24:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:28,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:28,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:28,379 INFO L427 AbstractCegarLoop]: === Iteration 908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:28,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:28,379 INFO L82 PathProgramCache]: Analyzing trace with hash -22720570, now seen corresponding path program 900 times [2020-02-10 20:24:28,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:28,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692293790] [2020-02-10 20:24:28,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:28,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692293790] [2020-02-10 20:24:28,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:28,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:28,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457775746] [2020-02-10 20:24:28,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:28,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:28,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:28,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:28,884 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:24:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:29,157 INFO L93 Difference]: Finished difference Result 2857 states and 11400 transitions. [2020-02-10 20:24:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:29,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:29,165 INFO L225 Difference]: With dead ends: 2857 [2020-02-10 20:24:29,165 INFO L226 Difference]: Without dead ends: 2838 [2020-02-10 20:24:29,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2020-02-10 20:24:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 1561. [2020-02-10 20:24:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:24:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7012 transitions. [2020-02-10 20:24:29,228 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7012 transitions. Word has length 28 [2020-02-10 20:24:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:29,228 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7012 transitions. [2020-02-10 20:24:29,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7012 transitions. [2020-02-10 20:24:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:29,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:29,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, 1, 1, 1] [2020-02-10 20:24:29,231 INFO L427 AbstractCegarLoop]: === Iteration 909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:29,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:29,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1324838688, now seen corresponding path program 901 times [2020-02-10 20:24:29,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:29,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466419952] [2020-02-10 20:24:29,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:29,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466419952] [2020-02-10 20:24:29,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:29,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:29,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225672527] [2020-02-10 20:24:29,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:29,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:29,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:29,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:29,722 INFO L87 Difference]: Start difference. First operand 1561 states and 7012 transitions. Second operand 11 states. [2020-02-10 20:24:29,957 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-02-10 20:24:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:29,971 INFO L93 Difference]: Finished difference Result 2867 states and 11428 transitions. [2020-02-10 20:24:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:29,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:29,979 INFO L225 Difference]: With dead ends: 2867 [2020-02-10 20:24:29,980 INFO L226 Difference]: Without dead ends: 2852 [2020-02-10 20:24:29,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-02-10 20:24:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1569. [2020-02-10 20:24:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:24:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7032 transitions. [2020-02-10 20:24:30,042 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7032 transitions. Word has length 28 [2020-02-10 20:24:30,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:30,042 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7032 transitions. [2020-02-10 20:24:30,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7032 transitions. [2020-02-10 20:24:30,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:30,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:30,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:30,045 INFO L427 AbstractCegarLoop]: === Iteration 910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:30,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:30,045 INFO L82 PathProgramCache]: Analyzing trace with hash -736021114, now seen corresponding path program 902 times [2020-02-10 20:24:30,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:30,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140409767] [2020-02-10 20:24:30,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:30,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140409767] [2020-02-10 20:24:30,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:30,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:30,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547690924] [2020-02-10 20:24:30,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:30,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:30,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:30,534 INFO L87 Difference]: Start difference. First operand 1569 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:24:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:30,721 INFO L93 Difference]: Finished difference Result 2870 states and 11429 transitions. [2020-02-10 20:24:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:30,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:30,729 INFO L225 Difference]: With dead ends: 2870 [2020-02-10 20:24:30,729 INFO L226 Difference]: Without dead ends: 2847 [2020-02-10 20:24:30,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2020-02-10 20:24:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 1564. [2020-02-10 20:24:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:24:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7020 transitions. [2020-02-10 20:24:30,792 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7020 transitions. Word has length 28 [2020-02-10 20:24:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:30,792 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7020 transitions. [2020-02-10 20:24:30,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7020 transitions. [2020-02-10 20:24:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:30,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:30,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:30,794 INFO L427 AbstractCegarLoop]: === Iteration 911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1813018396, now seen corresponding path program 903 times [2020-02-10 20:24:30,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:30,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810492276] [2020-02-10 20:24:30,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:31,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810492276] [2020-02-10 20:24:31,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:31,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:31,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805550581] [2020-02-10 20:24:31,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:31,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:31,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:31,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:31,294 INFO L87 Difference]: Start difference. First operand 1564 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:24:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:31,467 INFO L93 Difference]: Finished difference Result 2860 states and 11409 transitions. [2020-02-10 20:24:31,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:31,468 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:31,475 INFO L225 Difference]: With dead ends: 2860 [2020-02-10 20:24:31,475 INFO L226 Difference]: Without dead ends: 2845 [2020-02-10 20:24:31,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2020-02-10 20:24:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 1567. [2020-02-10 20:24:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:24:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:24:31,540 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:24:31,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:31,540 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:24:31,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:24:31,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:31,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:31,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:31,543 INFO L427 AbstractCegarLoop]: === Iteration 912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:31,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:31,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1134818144, now seen corresponding path program 904 times [2020-02-10 20:24:31,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:31,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128151366] [2020-02-10 20:24:31,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:32,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-02-10 20:24:32,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128151366] [2020-02-10 20:24:32,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:32,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:32,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132195654] [2020-02-10 20:24:32,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:32,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:32,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:32,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:32,052 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:24:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:32,230 INFO L93 Difference]: Finished difference Result 2858 states and 11402 transitions. [2020-02-10 20:24:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:32,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:32,237 INFO L225 Difference]: With dead ends: 2858 [2020-02-10 20:24:32,238 INFO L226 Difference]: Without dead ends: 2842 [2020-02-10 20:24:32,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2020-02-10 20:24:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1564. [2020-02-10 20:24:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:24:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7017 transitions. [2020-02-10 20:24:32,302 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7017 transitions. Word has length 28 [2020-02-10 20:24:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:32,302 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7017 transitions. [2020-02-10 20:24:32,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7017 transitions. [2020-02-10 20:24:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:32,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:32,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:32,305 INFO L427 AbstractCegarLoop]: === Iteration 913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:32,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:32,305 INFO L82 PathProgramCache]: Analyzing trace with hash 452598410, now seen corresponding path program 905 times [2020-02-10 20:24:32,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:32,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377460841] [2020-02-10 20:24:32,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:32,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377460841] [2020-02-10 20:24:32,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:32,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:32,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800538111] [2020-02-10 20:24:32,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:32,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:32,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:32,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:32,798 INFO L87 Difference]: Start difference. First operand 1564 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:24:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:32,973 INFO L93 Difference]: Finished difference Result 2866 states and 11418 transitions. [2020-02-10 20:24:32,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:32,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:32,981 INFO L225 Difference]: With dead ends: 2866 [2020-02-10 20:24:32,981 INFO L226 Difference]: Without dead ends: 2848 [2020-02-10 20:24:32,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2020-02-10 20:24:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1567. [2020-02-10 20:24:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:24:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7022 transitions. [2020-02-10 20:24:33,044 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7022 transitions. Word has length 28 [2020-02-10 20:24:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:33,044 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7022 transitions. [2020-02-10 20:24:33,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7022 transitions. [2020-02-10 20:24:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:33,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:33,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:33,046 INFO L427 AbstractCegarLoop]: === Iteration 914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:33,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:33,046 INFO L82 PathProgramCache]: Analyzing trace with hash 628471878, now seen corresponding path program 906 times [2020-02-10 20:24:33,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:33,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528794549] [2020-02-10 20:24:33,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:33,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528794549] [2020-02-10 20:24:33,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:33,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:33,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696416037] [2020-02-10 20:24:33,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:33,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:33,549 INFO L87 Difference]: Start difference. First operand 1567 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:24:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:33,747 INFO L93 Difference]: Finished difference Result 2861 states and 11405 transitions. [2020-02-10 20:24:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:33,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:33,754 INFO L225 Difference]: With dead ends: 2861 [2020-02-10 20:24:33,754 INFO L226 Difference]: Without dead ends: 2842 [2020-02-10 20:24:33,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2020-02-10 20:24:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1561. [2020-02-10 20:24:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:24:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7009 transitions. [2020-02-10 20:24:33,817 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7009 transitions. Word has length 28 [2020-02-10 20:24:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:33,818 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7009 transitions. [2020-02-10 20:24:33,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7009 transitions. [2020-02-10 20:24:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:33,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:33,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:33,820 INFO L427 AbstractCegarLoop]: === Iteration 915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash -288888928, now seen corresponding path program 907 times [2020-02-10 20:24:33,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:33,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713025735] [2020-02-10 20:24:33,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:34,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713025735] [2020-02-10 20:24:34,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:34,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:34,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804851631] [2020-02-10 20:24:34,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:34,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:34,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:34,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:34,329 INFO L87 Difference]: Start difference. First operand 1561 states and 7009 transitions. Second operand 11 states. [2020-02-10 20:24:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:34,507 INFO L93 Difference]: Finished difference Result 2872 states and 11437 transitions. [2020-02-10 20:24:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:34,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:34,514 INFO L225 Difference]: With dead ends: 2872 [2020-02-10 20:24:34,514 INFO L226 Difference]: Without dead ends: 2856 [2020-02-10 20:24:34,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2020-02-10 20:24:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1570. [2020-02-10 20:24:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:24:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7031 transitions. [2020-02-10 20:24:34,578 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7031 transitions. Word has length 28 [2020-02-10 20:24:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:34,579 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7031 transitions. [2020-02-10 20:24:34,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7031 transitions. [2020-02-10 20:24:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:34,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:34,581 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:34,581 INFO L427 AbstractCegarLoop]: === Iteration 916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:34,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:34,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1200516068, now seen corresponding path program 908 times [2020-02-10 20:24:34,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:34,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507779778] [2020-02-10 20:24:34,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:35,092 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:24:35,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-02-10 20:24:35,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507779778] [2020-02-10 20:24:35,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:35,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:35,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133757443] [2020-02-10 20:24:35,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:35,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:35,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:35,100 INFO L87 Difference]: Start difference. First operand 1570 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:24:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:35,266 INFO L93 Difference]: Finished difference Result 2874 states and 11435 transitions. [2020-02-10 20:24:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:35,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:35,274 INFO L225 Difference]: With dead ends: 2874 [2020-02-10 20:24:35,274 INFO L226 Difference]: Without dead ends: 2850 [2020-02-10 20:24:35,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:35,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2020-02-10 20:24:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 1564. [2020-02-10 20:24:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:24:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7017 transitions. [2020-02-10 20:24:35,337 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7017 transitions. Word has length 28 [2020-02-10 20:24:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:35,337 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7017 transitions. [2020-02-10 20:24:35,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7017 transitions. [2020-02-10 20:24:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:35,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:35,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, 1, 1, 1] [2020-02-10 20:24:35,340 INFO L427 AbstractCegarLoop]: === Iteration 917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:35,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:35,340 INFO L82 PathProgramCache]: Analyzing trace with hash 868221284, now seen corresponding path program 909 times [2020-02-10 20:24:35,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:35,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738123325] [2020-02-10 20:24:35,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:35,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738123325] [2020-02-10 20:24:35,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:35,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:35,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613211595] [2020-02-10 20:24:35,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:35,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:35,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:35,846 INFO L87 Difference]: Start difference. First operand 1564 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:24:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:36,019 INFO L93 Difference]: Finished difference Result 2864 states and 11415 transitions. [2020-02-10 20:24:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:36,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:36,068 INFO L225 Difference]: With dead ends: 2864 [2020-02-10 20:24:36,068 INFO L226 Difference]: Without dead ends: 2848 [2020-02-10 20:24:36,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2020-02-10 20:24:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1567. [2020-02-10 20:24:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:24:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7022 transitions. [2020-02-10 20:24:36,131 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7022 transitions. Word has length 28 [2020-02-10 20:24:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:36,131 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7022 transitions. [2020-02-10 20:24:36,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7022 transitions. [2020-02-10 20:24:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:36,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:36,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:36,134 INFO L427 AbstractCegarLoop]: === Iteration 918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:36,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1460414368, now seen corresponding path program 910 times [2020-02-10 20:24:36,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:36,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410591537] [2020-02-10 20:24:36,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:36,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410591537] [2020-02-10 20:24:36,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:36,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:36,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447367702] [2020-02-10 20:24:36,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:36,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:36,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:36,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:36,638 INFO L87 Difference]: Start difference. First operand 1567 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:24:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:36,843 INFO L93 Difference]: Finished difference Result 2861 states and 11406 transitions. [2020-02-10 20:24:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:36,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:36,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:36,851 INFO L225 Difference]: With dead ends: 2861 [2020-02-10 20:24:36,851 INFO L226 Difference]: Without dead ends: 2845 [2020-02-10 20:24:36,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2020-02-10 20:24:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 1564. [2020-02-10 20:24:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:24:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7014 transitions. [2020-02-10 20:24:36,916 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7014 transitions. Word has length 28 [2020-02-10 20:24:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:36,916 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7014 transitions. [2020-02-10 20:24:36,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7014 transitions. [2020-02-10 20:24:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:36,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:36,918 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:36,918 INFO L427 AbstractCegarLoop]: === Iteration 919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:36,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1916334808, now seen corresponding path program 911 times [2020-02-10 20:24:36,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:36,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547060498] [2020-02-10 20:24:36,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:37,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547060498] [2020-02-10 20:24:37,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:37,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:37,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623952066] [2020-02-10 20:24:37,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:37,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:37,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:37,426 INFO L87 Difference]: Start difference. First operand 1564 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:24:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:37,611 INFO L93 Difference]: Finished difference Result 2868 states and 11420 transitions. [2020-02-10 20:24:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:37,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:37,619 INFO L225 Difference]: With dead ends: 2868 [2020-02-10 20:24:37,619 INFO L226 Difference]: Without dead ends: 2850 [2020-02-10 20:24:37,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2020-02-10 20:24:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 1567. [2020-02-10 20:24:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:24:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7019 transitions. [2020-02-10 20:24:37,684 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7019 transitions. Word has length 28 [2020-02-10 20:24:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:37,684 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7019 transitions. [2020-02-10 20:24:37,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7019 transitions. [2020-02-10 20:24:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:37,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:37,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:37,686 INFO L427 AbstractCegarLoop]: === Iteration 920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1740461340, now seen corresponding path program 912 times [2020-02-10 20:24:37,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:37,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345562274] [2020-02-10 20:24:37,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:38,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345562274] [2020-02-10 20:24:38,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:38,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:38,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33458570] [2020-02-10 20:24:38,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:38,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:38,203 INFO L87 Difference]: Start difference. First operand 1567 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:24:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:38,403 INFO L93 Difference]: Finished difference Result 2863 states and 11407 transitions. [2020-02-10 20:24:38,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:38,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:38,410 INFO L225 Difference]: With dead ends: 2863 [2020-02-10 20:24:38,411 INFO L226 Difference]: Without dead ends: 2841 [2020-02-10 20:24:38,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2020-02-10 20:24:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 1558. [2020-02-10 20:24:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2020-02-10 20:24:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 7001 transitions. [2020-02-10 20:24:38,475 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 7001 transitions. Word has length 28 [2020-02-10 20:24:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:38,475 INFO L479 AbstractCegarLoop]: Abstraction has 1558 states and 7001 transitions. [2020-02-10 20:24:38,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 7001 transitions. [2020-02-10 20:24:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:38,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:38,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:38,477 INFO L427 AbstractCegarLoop]: === Iteration 921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1750104872, now seen corresponding path program 913 times [2020-02-10 20:24:38,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:38,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359541070] [2020-02-10 20:24:38,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:38,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359541070] [2020-02-10 20:24:38,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:38,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:38,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150918897] [2020-02-10 20:24:38,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:38,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:38,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:38,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:38,993 INFO L87 Difference]: Start difference. First operand 1558 states and 7001 transitions. Second operand 11 states. [2020-02-10 20:24:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:39,164 INFO L93 Difference]: Finished difference Result 2908 states and 11528 transitions. [2020-02-10 20:24:39,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:39,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:39,171 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:24:39,172 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 20:24:39,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 20:24:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1576. [2020-02-10 20:24:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:24:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7057 transitions. [2020-02-10 20:24:39,235 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7057 transitions. Word has length 28 [2020-02-10 20:24:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:39,235 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7057 transitions. [2020-02-10 20:24:39,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7057 transitions. [2020-02-10 20:24:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:39,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:39,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:39,237 INFO L427 AbstractCegarLoop]: === Iteration 922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1055457428, now seen corresponding path program 914 times [2020-02-10 20:24:39,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:39,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498226681] [2020-02-10 20:24:39,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:39,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498226681] [2020-02-10 20:24:39,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:39,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:39,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519262336] [2020-02-10 20:24:39,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:39,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:39,757 INFO L87 Difference]: Start difference. First operand 1576 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:24:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:39,935 INFO L93 Difference]: Finished difference Result 2913 states and 11532 transitions. [2020-02-10 20:24:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:39,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:39,943 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 20:24:39,943 INFO L226 Difference]: Without dead ends: 2887 [2020-02-10 20:24:39,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2020-02-10 20:24:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1570. [2020-02-10 20:24:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:24:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7040 transitions. [2020-02-10 20:24:40,011 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7040 transitions. Word has length 28 [2020-02-10 20:24:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:40,012 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7040 transitions. [2020-02-10 20:24:40,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7040 transitions. [2020-02-10 20:24:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:40,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:40,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:40,015 INFO L427 AbstractCegarLoop]: === Iteration 923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:40,015 INFO L82 PathProgramCache]: Analyzing trace with hash -933921466, now seen corresponding path program 915 times [2020-02-10 20:24:40,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:40,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783550933] [2020-02-10 20:24:40,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:40,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783550933] [2020-02-10 20:24:40,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:40,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:40,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476908359] [2020-02-10 20:24:40,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:40,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:40,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:40,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:40,530 INFO L87 Difference]: Start difference. First operand 1570 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:24:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:40,722 INFO L93 Difference]: Finished difference Result 2905 states and 11517 transitions. [2020-02-10 20:24:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:40,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:40,729 INFO L225 Difference]: With dead ends: 2905 [2020-02-10 20:24:40,729 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:24:40,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:40,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:24:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1575. [2020-02-10 20:24:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:24:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7049 transitions. [2020-02-10 20:24:40,793 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7049 transitions. Word has length 28 [2020-02-10 20:24:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:40,793 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7049 transitions. [2020-02-10 20:24:40,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7049 transitions. [2020-02-10 20:24:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:40,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:40,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:40,796 INFO L427 AbstractCegarLoop]: === Iteration 924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:40,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:40,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1300186028, now seen corresponding path program 916 times [2020-02-10 20:24:40,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:40,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128861866] [2020-02-10 20:24:40,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:41,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128861866] [2020-02-10 20:24:41,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:41,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:41,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770410865] [2020-02-10 20:24:41,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:41,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:41,311 INFO L87 Difference]: Start difference. First operand 1575 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:24:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:41,488 INFO L93 Difference]: Finished difference Result 2908 states and 11518 transitions. [2020-02-10 20:24:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:41,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:41,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:41,495 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:24:41,496 INFO L226 Difference]: Without dead ends: 2885 [2020-02-10 20:24:41,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2020-02-10 20:24:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1570. [2020-02-10 20:24:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:24:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7035 transitions. [2020-02-10 20:24:41,560 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7035 transitions. Word has length 28 [2020-02-10 20:24:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:41,560 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7035 transitions. [2020-02-10 20:24:41,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7035 transitions. [2020-02-10 20:24:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:41,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:41,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:41,563 INFO L427 AbstractCegarLoop]: === Iteration 925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:41,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:41,563 INFO L82 PathProgramCache]: Analyzing trace with hash -517601850, now seen corresponding path program 917 times [2020-02-10 20:24:41,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:41,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827825967] [2020-02-10 20:24:41,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:42,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827825967] [2020-02-10 20:24:42,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:42,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:42,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854515045] [2020-02-10 20:24:42,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:42,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:42,088 INFO L87 Difference]: Start difference. First operand 1570 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:24:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:42,274 INFO L93 Difference]: Finished difference Result 2920 states and 11542 transitions. [2020-02-10 20:24:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:42,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:42,282 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:24:42,282 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:24:42,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:24:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1580. [2020-02-10 20:24:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:24:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7052 transitions. [2020-02-10 20:24:42,346 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7052 transitions. Word has length 28 [2020-02-10 20:24:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:42,347 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7052 transitions. [2020-02-10 20:24:42,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7052 transitions. [2020-02-10 20:24:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:42,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:42,349 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:42,349 INFO L427 AbstractCegarLoop]: === Iteration 926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:42,349 INFO L82 PathProgramCache]: Analyzing trace with hash 227100648, now seen corresponding path program 918 times [2020-02-10 20:24:42,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:42,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290688350] [2020-02-10 20:24:42,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:42,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290688350] [2020-02-10 20:24:42,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:42,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:42,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180990677] [2020-02-10 20:24:42,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:42,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:42,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:42,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:42,862 INFO L87 Difference]: Start difference. First operand 1580 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:24:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:43,069 INFO L93 Difference]: Finished difference Result 2918 states and 11530 transitions. [2020-02-10 20:24:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:43,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:43,076 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 20:24:43,076 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:24:43,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:24:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1563. [2020-02-10 20:24:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:24:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7017 transitions. [2020-02-10 20:24:43,141 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7017 transitions. Word has length 28 [2020-02-10 20:24:43,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:43,141 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7017 transitions. [2020-02-10 20:24:43,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7017 transitions. [2020-02-10 20:24:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:43,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:43,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:43,144 INFO L427 AbstractCegarLoop]: === Iteration 927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:43,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1034184220, now seen corresponding path program 919 times [2020-02-10 20:24:43,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:43,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983873404] [2020-02-10 20:24:43,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:43,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983873404] [2020-02-10 20:24:43,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:43,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:43,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718046553] [2020-02-10 20:24:43,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:43,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:43,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:43,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:43,638 INFO L87 Difference]: Start difference. First operand 1563 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:24:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:43,805 INFO L93 Difference]: Finished difference Result 2892 states and 11481 transitions. [2020-02-10 20:24:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:43,806 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:43,813 INFO L225 Difference]: With dead ends: 2892 [2020-02-10 20:24:43,813 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:24:43,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:24:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1573. [2020-02-10 20:24:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:24:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7042 transitions. [2020-02-10 20:24:43,877 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7042 transitions. Word has length 28 [2020-02-10 20:24:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:43,877 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7042 transitions. [2020-02-10 20:24:43,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7042 transitions. [2020-02-10 20:24:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:43,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:43,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:43,879 INFO L427 AbstractCegarLoop]: === Iteration 928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash 455220776, now seen corresponding path program 920 times [2020-02-10 20:24:43,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:43,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783578718] [2020-02-10 20:24:43,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:44,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783578718] [2020-02-10 20:24:44,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:44,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:44,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788259840] [2020-02-10 20:24:44,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:44,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:44,377 INFO L87 Difference]: Start difference. First operand 1573 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:24:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:44,511 INFO L93 Difference]: Finished difference Result 2897 states and 11485 transitions. [2020-02-10 20:24:44,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:44,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:44,518 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:24:44,519 INFO L226 Difference]: Without dead ends: 2871 [2020-02-10 20:24:44,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2020-02-10 20:24:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1567. [2020-02-10 20:24:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:24:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7027 transitions. [2020-02-10 20:24:44,587 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7027 transitions. Word has length 28 [2020-02-10 20:24:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:44,587 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7027 transitions. [2020-02-10 20:24:44,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7027 transitions. [2020-02-10 20:24:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:44,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:44,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:44,589 INFO L427 AbstractCegarLoop]: === Iteration 929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash 133429096, now seen corresponding path program 921 times [2020-02-10 20:24:44,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:44,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369971967] [2020-02-10 20:24:44,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:45,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369971967] [2020-02-10 20:24:45,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:45,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:45,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159144557] [2020-02-10 20:24:45,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:45,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:45,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:45,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:45,126 INFO L87 Difference]: Start difference. First operand 1567 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:24:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:45,306 INFO L93 Difference]: Finished difference Result 2882 states and 11456 transitions. [2020-02-10 20:24:45,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:45,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:45,313 INFO L225 Difference]: With dead ends: 2882 [2020-02-10 20:24:45,314 INFO L226 Difference]: Without dead ends: 2867 [2020-02-10 20:24:45,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2020-02-10 20:24:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1570. [2020-02-10 20:24:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:24:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7032 transitions. [2020-02-10 20:24:45,377 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7032 transitions. Word has length 28 [2020-02-10 20:24:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:45,377 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7032 transitions. [2020-02-10 20:24:45,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7032 transitions. [2020-02-10 20:24:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:45,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:45,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:45,379 INFO L427 AbstractCegarLoop]: === Iteration 930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1213701660, now seen corresponding path program 922 times [2020-02-10 20:24:45,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:45,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44267599] [2020-02-10 20:24:45,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:45,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44267599] [2020-02-10 20:24:45,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:45,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:45,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031185338] [2020-02-10 20:24:45,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:45,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:45,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:45,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:45,970 INFO L87 Difference]: Start difference. First operand 1570 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:24:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:46,144 INFO L93 Difference]: Finished difference Result 2880 states and 11449 transitions. [2020-02-10 20:24:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:46,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:46,151 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 20:24:46,151 INFO L226 Difference]: Without dead ends: 2864 [2020-02-10 20:24:46,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2020-02-10 20:24:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 1567. [2020-02-10 20:24:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:24:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7024 transitions. [2020-02-10 20:24:46,216 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7024 transitions. Word has length 28 [2020-02-10 20:24:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:46,216 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7024 transitions. [2020-02-10 20:24:46,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7024 transitions. [2020-02-10 20:24:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:46,218 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:46,218 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:46,219 INFO L427 AbstractCegarLoop]: === Iteration 931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:46,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1643840300, now seen corresponding path program 923 times [2020-02-10 20:24:46,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:46,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758089651] [2020-02-10 20:24:46,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:46,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758089651] [2020-02-10 20:24:46,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:46,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:46,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895533705] [2020-02-10 20:24:46,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:46,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:46,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:46,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:46,700 INFO L87 Difference]: Start difference. First operand 1567 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:24:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:46,829 INFO L93 Difference]: Finished difference Result 2893 states and 11473 transitions. [2020-02-10 20:24:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:46,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:46,837 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:24:46,837 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 20:24:46,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 20:24:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1571. [2020-02-10 20:24:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:24:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7030 transitions. [2020-02-10 20:24:46,902 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7030 transitions. Word has length 28 [2020-02-10 20:24:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:46,902 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7030 transitions. [2020-02-10 20:24:46,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7030 transitions. [2020-02-10 20:24:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:46,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:46,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:46,905 INFO L427 AbstractCegarLoop]: === Iteration 932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash -119610072, now seen corresponding path program 924 times [2020-02-10 20:24:46,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:46,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490502868] [2020-02-10 20:24:46,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:47,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490502868] [2020-02-10 20:24:47,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:47,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:47,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635268790] [2020-02-10 20:24:47,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:47,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:47,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:47,391 INFO L87 Difference]: Start difference. First operand 1571 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:24:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:47,568 INFO L93 Difference]: Finished difference Result 2886 states and 11456 transitions. [2020-02-10 20:24:47,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:47,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:47,575 INFO L225 Difference]: With dead ends: 2886 [2020-02-10 20:24:47,575 INFO L226 Difference]: Without dead ends: 2865 [2020-02-10 20:24:47,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-02-10 20:24:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 1563. [2020-02-10 20:24:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:24:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7013 transitions. [2020-02-10 20:24:47,638 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7013 transitions. Word has length 28 [2020-02-10 20:24:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:47,638 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7013 transitions. [2020-02-10 20:24:47,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7013 transitions. [2020-02-10 20:24:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:47,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:47,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, 1, 1, 1] [2020-02-10 20:24:47,641 INFO L427 AbstractCegarLoop]: === Iteration 933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:47,641 INFO L82 PathProgramCache]: Analyzing trace with hash 902352962, now seen corresponding path program 925 times [2020-02-10 20:24:47,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:47,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78901668] [2020-02-10 20:24:47,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:48,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78901668] [2020-02-10 20:24:48,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:48,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:48,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029738726] [2020-02-10 20:24:48,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:48,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:48,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:48,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:48,139 INFO L87 Difference]: Start difference. First operand 1563 states and 7013 transitions. Second operand 11 states. [2020-02-10 20:24:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:48,337 INFO L93 Difference]: Finished difference Result 2884 states and 11462 transitions. [2020-02-10 20:24:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:48,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:48,343 INFO L225 Difference]: With dead ends: 2884 [2020-02-10 20:24:48,343 INFO L226 Difference]: Without dead ends: 2869 [2020-02-10 20:24:48,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2020-02-10 20:24:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1571. [2020-02-10 20:24:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:24:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7033 transitions. [2020-02-10 20:24:48,451 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7033 transitions. Word has length 28 [2020-02-10 20:24:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:48,452 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7033 transitions. [2020-02-10 20:24:48,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7033 transitions. [2020-02-10 20:24:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:48,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:48,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:48,454 INFO L427 AbstractCegarLoop]: === Iteration 934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1158506840, now seen corresponding path program 926 times [2020-02-10 20:24:48,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:48,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858195156] [2020-02-10 20:24:48,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:48,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858195156] [2020-02-10 20:24:48,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:48,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:48,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706774475] [2020-02-10 20:24:48,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:48,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:48,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:48,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:48,956 INFO L87 Difference]: Start difference. First operand 1571 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:24:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:49,136 INFO L93 Difference]: Finished difference Result 2887 states and 11463 transitions. [2020-02-10 20:24:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:49,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:49,144 INFO L225 Difference]: With dead ends: 2887 [2020-02-10 20:24:49,144 INFO L226 Difference]: Without dead ends: 2864 [2020-02-10 20:24:49,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2020-02-10 20:24:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 1566. [2020-02-10 20:24:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:24:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7021 transitions. [2020-02-10 20:24:49,208 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7021 transitions. Word has length 28 [2020-02-10 20:24:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:49,209 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7021 transitions. [2020-02-10 20:24:49,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7021 transitions. [2020-02-10 20:24:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:49,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:49,211 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:49,211 INFO L427 AbstractCegarLoop]: === Iteration 935 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:49,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2059463174, now seen corresponding path program 927 times [2020-02-10 20:24:49,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:49,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114935308] [2020-02-10 20:24:49,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:49,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114935308] [2020-02-10 20:24:49,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:49,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:49,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820131809] [2020-02-10 20:24:49,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:49,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:49,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:49,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:49,711 INFO L87 Difference]: Start difference. First operand 1566 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:24:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:49,884 INFO L93 Difference]: Finished difference Result 2877 states and 11443 transitions. [2020-02-10 20:24:49,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:49,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:49,892 INFO L225 Difference]: With dead ends: 2877 [2020-02-10 20:24:49,892 INFO L226 Difference]: Without dead ends: 2862 [2020-02-10 20:24:49,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2020-02-10 20:24:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1569. [2020-02-10 20:24:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:24:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7026 transitions. [2020-02-10 20:24:49,956 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7026 transitions. Word has length 28 [2020-02-10 20:24:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:49,956 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7026 transitions. [2020-02-10 20:24:49,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7026 transitions. [2020-02-10 20:24:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:49,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:49,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:49,958 INFO L427 AbstractCegarLoop]: === Iteration 936 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:49,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:49,958 INFO L82 PathProgramCache]: Analyzing trace with hash 712332418, now seen corresponding path program 928 times [2020-02-10 20:24:49,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:49,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583993890] [2020-02-10 20:24:49,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:50,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583993890] [2020-02-10 20:24:50,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:50,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:50,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592486804] [2020-02-10 20:24:50,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:50,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:50,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:50,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:50,464 INFO L87 Difference]: Start difference. First operand 1569 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:24:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:50,662 INFO L93 Difference]: Finished difference Result 2875 states and 11436 transitions. [2020-02-10 20:24:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:50,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:50,670 INFO L225 Difference]: With dead ends: 2875 [2020-02-10 20:24:50,671 INFO L226 Difference]: Without dead ends: 2859 [2020-02-10 20:24:50,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-02-10 20:24:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 1566. [2020-02-10 20:24:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:24:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7018 transitions. [2020-02-10 20:24:50,735 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7018 transitions. Word has length 28 [2020-02-10 20:24:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:50,735 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7018 transitions. [2020-02-10 20:24:50,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7018 transitions. [2020-02-10 20:24:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:50,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:50,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:50,738 INFO L427 AbstractCegarLoop]: === Iteration 937 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:50,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:50,738 INFO L82 PathProgramCache]: Analyzing trace with hash 30112684, now seen corresponding path program 929 times [2020-02-10 20:24:50,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:50,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132043570] [2020-02-10 20:24:50,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:51,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132043570] [2020-02-10 20:24:51,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:51,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:51,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796248794] [2020-02-10 20:24:51,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:51,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:51,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:51,220 INFO L87 Difference]: Start difference. First operand 1566 states and 7018 transitions. Second operand 11 states. [2020-02-10 20:24:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:51,389 INFO L93 Difference]: Finished difference Result 2883 states and 11452 transitions. [2020-02-10 20:24:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:51,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:51,397 INFO L225 Difference]: With dead ends: 2883 [2020-02-10 20:24:51,397 INFO L226 Difference]: Without dead ends: 2865 [2020-02-10 20:24:51,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-02-10 20:24:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 1569. [2020-02-10 20:24:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:24:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7023 transitions. [2020-02-10 20:24:51,461 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7023 transitions. Word has length 28 [2020-02-10 20:24:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:51,461 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7023 transitions. [2020-02-10 20:24:51,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7023 transitions. [2020-02-10 20:24:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:51,464 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:51,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:51,464 INFO L427 AbstractCegarLoop]: === Iteration 938 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash 205986152, now seen corresponding path program 930 times [2020-02-10 20:24:51,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:51,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524599758] [2020-02-10 20:24:51,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:51,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524599758] [2020-02-10 20:24:51,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:51,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:51,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770717058] [2020-02-10 20:24:51,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:51,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:51,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:51,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:51,947 INFO L87 Difference]: Start difference. First operand 1569 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:24:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:52,122 INFO L93 Difference]: Finished difference Result 2878 states and 11439 transitions. [2020-02-10 20:24:52,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:52,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:52,129 INFO L225 Difference]: With dead ends: 2878 [2020-02-10 20:24:52,129 INFO L226 Difference]: Without dead ends: 2859 [2020-02-10 20:24:52,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-02-10 20:24:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 1563. [2020-02-10 20:24:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:24:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7010 transitions. [2020-02-10 20:24:52,189 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7010 transitions. Word has length 28 [2020-02-10 20:24:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:52,189 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7010 transitions. [2020-02-10 20:24:52,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7010 transitions. [2020-02-10 20:24:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:52,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:52,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:52,191 INFO L427 AbstractCegarLoop]: === Iteration 939 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1969865026, now seen corresponding path program 931 times [2020-02-10 20:24:52,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:52,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669212412] [2020-02-10 20:24:52,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:52,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669212412] [2020-02-10 20:24:52,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:52,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:52,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578485710] [2020-02-10 20:24:52,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:52,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:52,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:52,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:52,688 INFO L87 Difference]: Start difference. First operand 1563 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:24:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:52,820 INFO L93 Difference]: Finished difference Result 2912 states and 11517 transitions. [2020-02-10 20:24:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:52,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:52,827 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:24:52,827 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 20:24:52,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 20:24:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1578. [2020-02-10 20:24:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:24:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7043 transitions. [2020-02-10 20:24:52,888 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7043 transitions. Word has length 28 [2020-02-10 20:24:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:52,888 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7043 transitions. [2020-02-10 20:24:52,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7043 transitions. [2020-02-10 20:24:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:52,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:52,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:52,890 INFO L427 AbstractCegarLoop]: === Iteration 940 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:52,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1580399772, now seen corresponding path program 932 times [2020-02-10 20:24:52,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:52,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733830889] [2020-02-10 20:24:52,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:53,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733830889] [2020-02-10 20:24:53,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:53,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:53,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897243110] [2020-02-10 20:24:53,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:53,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:53,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:53,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:53,375 INFO L87 Difference]: Start difference. First operand 1578 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:24:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:53,533 INFO L93 Difference]: Finished difference Result 2910 states and 11505 transitions. [2020-02-10 20:24:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:53,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:53,540 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:24:53,540 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 20:24:53,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 20:24:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1568. [2020-02-10 20:24:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:24:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7021 transitions. [2020-02-10 20:24:53,600 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7021 transitions. Word has length 28 [2020-02-10 20:24:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:53,601 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7021 transitions. [2020-02-10 20:24:53,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7021 transitions. [2020-02-10 20:24:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:53,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:53,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:53,603 INFO L427 AbstractCegarLoop]: === Iteration 941 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1167992058, now seen corresponding path program 933 times [2020-02-10 20:24:53,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:53,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367481508] [2020-02-10 20:24:53,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:54,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367481508] [2020-02-10 20:24:54,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:54,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:54,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682560505] [2020-02-10 20:24:54,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:54,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:54,073 INFO L87 Difference]: Start difference. First operand 1568 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:24:54,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:54,205 INFO L93 Difference]: Finished difference Result 2901 states and 11486 transitions. [2020-02-10 20:24:54,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:54,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:54,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:54,211 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 20:24:54,211 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:24:54,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:24:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1572. [2020-02-10 20:24:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:24:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7027 transitions. [2020-02-10 20:24:54,272 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7027 transitions. Word has length 28 [2020-02-10 20:24:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:54,272 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7027 transitions. [2020-02-10 20:24:54,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7027 transitions. [2020-02-10 20:24:54,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:54,274 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:54,274 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:54,274 INFO L427 AbstractCegarLoop]: === Iteration 942 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1363524866, now seen corresponding path program 934 times [2020-02-10 20:24:54,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:54,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42118785] [2020-02-10 20:24:54,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:54,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42118785] [2020-02-10 20:24:54,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:54,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:54,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103160824] [2020-02-10 20:24:54,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:54,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:54,782 INFO L87 Difference]: Start difference. First operand 1572 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:24:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:54,965 INFO L93 Difference]: Finished difference Result 2894 states and 11469 transitions. [2020-02-10 20:24:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:54,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:54,973 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 20:24:54,973 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:24:54,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:24:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1568. [2020-02-10 20:24:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:24:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7017 transitions. [2020-02-10 20:24:55,032 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7017 transitions. Word has length 28 [2020-02-10 20:24:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:55,032 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7017 transitions. [2020-02-10 20:24:55,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7017 transitions. [2020-02-10 20:24:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:55,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:55,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:55,035 INFO L427 AbstractCegarLoop]: === Iteration 943 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash -412786456, now seen corresponding path program 935 times [2020-02-10 20:24:55,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:55,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434169744] [2020-02-10 20:24:55,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:55,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434169744] [2020-02-10 20:24:55,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:55,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:55,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598984346] [2020-02-10 20:24:55,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:55,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:55,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:55,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:55,492 INFO L87 Difference]: Start difference. First operand 1568 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:24:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:55,659 INFO L93 Difference]: Finished difference Result 2896 states and 11474 transitions. [2020-02-10 20:24:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:55,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:55,666 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:24:55,667 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:24:55,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:24:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1571. [2020-02-10 20:24:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:24:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7022 transitions. [2020-02-10 20:24:55,727 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7022 transitions. Word has length 28 [2020-02-10 20:24:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:55,727 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7022 transitions. [2020-02-10 20:24:55,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7022 transitions. [2020-02-10 20:24:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:55,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:55,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, 1, 1, 1] [2020-02-10 20:24:55,729 INFO L427 AbstractCegarLoop]: === Iteration 944 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:55,730 INFO L82 PathProgramCache]: Analyzing trace with hash -236912988, now seen corresponding path program 936 times [2020-02-10 20:24:55,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:55,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785092345] [2020-02-10 20:24:55,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:56,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785092345] [2020-02-10 20:24:56,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:56,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:56,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878784385] [2020-02-10 20:24:56,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:56,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:56,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:56,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:56,197 INFO L87 Difference]: Start difference. First operand 1571 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:24:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:56,389 INFO L93 Difference]: Finished difference Result 2891 states and 11461 transitions. [2020-02-10 20:24:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:56,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:56,396 INFO L225 Difference]: With dead ends: 2891 [2020-02-10 20:24:56,396 INFO L226 Difference]: Without dead ends: 2865 [2020-02-10 20:24:56,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-02-10 20:24:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 1558. [2020-02-10 20:24:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2020-02-10 20:24:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 6996 transitions. [2020-02-10 20:24:56,456 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 6996 transitions. Word has length 28 [2020-02-10 20:24:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:56,457 INFO L479 AbstractCegarLoop]: Abstraction has 1558 states and 6996 transitions. [2020-02-10 20:24:56,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 6996 transitions. [2020-02-10 20:24:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:56,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:56,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:56,459 INFO L427 AbstractCegarLoop]: === Iteration 945 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:56,459 INFO L82 PathProgramCache]: Analyzing trace with hash -286108470, now seen corresponding path program 937 times [2020-02-10 20:24:56,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:56,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475101167] [2020-02-10 20:24:56,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:56,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475101167] [2020-02-10 20:24:56,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:56,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:56,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397472796] [2020-02-10 20:24:56,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:56,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:56,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:56,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:56,955 INFO L87 Difference]: Start difference. First operand 1558 states and 6996 transitions. Second operand 11 states. [2020-02-10 20:24:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:57,194 INFO L93 Difference]: Finished difference Result 2919 states and 11554 transitions. [2020-02-10 20:24:57,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:57,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:57,202 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:24:57,202 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:24:57,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:24:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1578. [2020-02-10 20:24:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:24:57,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7058 transitions. [2020-02-10 20:24:57,262 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7058 transitions. Word has length 28 [2020-02-10 20:24:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:57,263 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7058 transitions. [2020-02-10 20:24:57,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7058 transitions. [2020-02-10 20:24:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:57,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:57,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:57,265 INFO L427 AbstractCegarLoop]: === Iteration 946 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:57,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:57,265 INFO L82 PathProgramCache]: Analyzing trace with hash 458594028, now seen corresponding path program 938 times [2020-02-10 20:24:57,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:57,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643524873] [2020-02-10 20:24:57,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:57,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643524873] [2020-02-10 20:24:57,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:57,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:24:57,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869827112] [2020-02-10 20:24:57,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:24:57,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:57,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:24:57,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:57,769 INFO L87 Difference]: Start difference. First operand 1578 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:24:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:57,912 INFO L93 Difference]: Finished difference Result 2923 states and 11555 transitions. [2020-02-10 20:24:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:24:57,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:24:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:57,920 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:24:57,920 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:24:57,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:24:57,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:24:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1571. [2020-02-10 20:24:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:24:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7038 transitions. [2020-02-10 20:24:57,980 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7038 transitions. Word has length 28 [2020-02-10 20:24:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:57,980 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7038 transitions. [2020-02-10 20:24:57,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:24:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7038 transitions. [2020-02-10 20:24:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:24:57,982 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:57,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:57,983 INFO L427 AbstractCegarLoop]: === Iteration 947 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:57,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:57,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1324832488, now seen corresponding path program 939 times [2020-02-10 20:24:57,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:57,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754388905] [2020-02-10 20:24:57,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2020-02-10 20:24:58,155 WARN L209 SmtUtils]: Removed 4 from assertion stack [2020-02-10 20:24:58,155 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 20:24:58,158 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 20:24:58,159 INFO L202 PluginConnector]: Adding new model example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:24:58 BasicIcfg [2020-02-10 20:24:58,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:24:58,160 INFO L168 Benchmark]: Toolchain (without parser) took 770307.42 ms. Allocated memory was 142.1 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 117.2 MB in the beginning and 591.6 MB in the end (delta: -474.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2020-02-10 20:24:58,160 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.46 ms. Allocated memory is still 142.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:24:58,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.37 ms. Allocated memory is still 142.1 MB. Free memory was 117.0 MB in the beginning and 115.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:58,161 INFO L168 Benchmark]: Boogie Preprocessor took 20.29 ms. Allocated memory is still 142.1 MB. Free memory was 115.2 MB in the beginning and 114.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:58,161 INFO L168 Benchmark]: RCFGBuilder took 389.17 ms. Allocated memory is still 142.1 MB. Free memory was 114.1 MB in the beginning and 100.0 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:58,161 INFO L168 Benchmark]: TraceAbstraction took 769857.03 ms. Allocated memory was 142.1 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 99.5 MB in the beginning and 591.6 MB in the end (delta: -492.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2020-02-10 20:24:58,163 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.46 ms. Allocated memory is still 142.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.37 ms. Allocated memory is still 142.1 MB. Free memory was 117.0 MB in the beginning and 115.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.29 ms. Allocated memory is still 142.1 MB. Free memory was 115.2 MB in the beginning and 114.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 389.17 ms. Allocated memory is still 142.1 MB. Free memory was 114.1 MB in the beginning and 100.0 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 769857.03 ms. Allocated memory was 142.1 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 99.5 MB in the beginning and 591.6 MB in the end (delta: -492.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.4s, 76 ProgramPointsBefore, 66 ProgramPointsAfterwards, 120 TransitionsBefore, 110 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 720 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 756 CheckedPairsTotal, 10 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 36 for 29ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 769.5s, OverallIterations: 947, TraceHistogramMax: 1, AutomataDifference: 192.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 115698 SDtfs, 169412 SDslu, 307151 SDs, 0 SdLazy, 83568 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 82.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10342 GetRequests, 954 SyntacticMatches, 0 SemanticMatches, 9388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6566 ImplicationChecksByTransitivity, 543.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20196occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 66.8s AutomataMinimizationTime, 946 MinimizatonAttempts, 1275856 StatesRemovedByMinimization, 938 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 493.6s InterpolantComputationTime, 26488 NumberOfCodeBlocks, 26488 NumberOfCodeBlocksAsserted, 946 NumberOfCheckSat, 25542 ConstructedInterpolants, 0 QuantifiedInterpolants, 22676544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 946 InterpolantComputations, 946 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